refactor 66

fishercoder1534 · fishercoder1534 · commit b82a3159f288 · 2020-05-03T18:13:32.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_66.java b/src/main/java/com/fishercoder/solutions/_66.java
@@ -1,40 +1,23 @@
 package com.fishercoder.solutions;
 
-/**
- * 66. Plus One
- *
- * Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
- * The digits are stored such that the most significant digit is at the head of the list,
- * and each element in the array contain a single digit.
- *
- * You may assume the integer does not contain any leading zero, except the number 0 itself.
- *
- * Example 1:
- * Input: [1,2,3]
- * Output: [1,2,4]
- * Explanation: The array represents the integer 123.
- *
- * Example 2:
- * Input: [4,3,2,1]
- * Output: [4,3,2,2]
- * Explanation: The array represents the integer 4321.
- */
 public class _66 {
 
-  public static class Solution1 {
-      /**credit: https://leetcode.com/problems/plus-one/discuss/24082/My-Simple-Java-Solution*/
-    public int[] plusOne(int[] digits) {
-        int len = digits.length;
-        for (int i = len - 1; i >= 0; i--) {
-            if (digits[i] < 9) {
-                digits[i]++;
-                return digits;
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/problems/plus-one/discuss/24082/My-Simple-Java-Solution
+         */
+        public int[] plusOne(int[] digits) {
+            int len = digits.length;
+            for (int i = len - 1; i >= 0; i--) {
+                if (digits[i] < 9) {
+                    digits[i]++;
+                    return digits;
+                }
+                digits[i] = 0;
             }
-            digits[i] = 0;
+            int[] newNumber = new int[len + 1];
+            newNumber[0] = 1;
+            return newNumber;
         }
-        int[] newNumber = new int[len + 1];
-        newNumber[0] = 1;
-        return newNumber;
     }
-  }
 }
