refactor 66

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/_66.java

@@ -20,14 +20,14 @@ public int[] plusOne(int[] digits) {
             return newNumber;
         }
     }
-    
+
     public static class Solution2 {
-    	public int[] plusOne(int[] digits) {
+        public int[] plusOne(int[] digits) {
             int len = digits.length;
             for (int i = len - 1; i >= 0; i--) {
                 if (digits[i] == 9) {
-                	digits[i] = 0;
-                } else  {
+                    digits[i] = 0;
+                } else {
                     digits[i]++;
                     return digits;
                 }

Diff for: src/test/java/com/fishercoder/_66Test.java

@@ -35,7 +35,7 @@ public void test3() {
         digits = new int[]{2, 4, 9, 3, 9};
         assertArrayEquals(new int[]{2, 4, 9, 4, 0}, solution1.plusOne(digits));
     }
-    
+
     @Test
     public void test4() {
         digits = new int[]{9, 9, 9, 9, 9};
@@ -47,11 +47,11 @@ public void test5() {
         digits = new int[]{8, 9, 9, 9, 9};
         assertArrayEquals(new int[]{9, 0, 0, 0, 0}, solution2.plusOne(digits));
     }
-    
+
     @Test
     public void test6() {
         digits = new int[]{2, 4, 9, 4, 9};
         assertArrayEquals(new int[]{2, 4, 9, 5, 0}, solution2.plusOne(digits));
     }
-    
+
 }