refactor 80

fishercoder1534 · fishercoder1534 · commit ee43c940d114 · 2020-05-05T14:43:41.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_80.java b/src/main/java/com/fishercoder/solutions/_80.java
@@ -3,51 +3,39 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 80. Remove Duplicates from Sorted Array II
- *
- * Follow up for "Remove Duplicates":
- What if duplicates are allowed at most twice?
-
- For example,
- Given sorted array nums = [1,1,1,2,2,3],
-
- Your function should return length = 5,
- with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.
- */
 public class _80 {
 
-  public static class Solution1 {
-    public int removeDuplicates(int[] nums) {
-      int counter = 0;
-      int len = nums.length;
-      if (len == 0) {
-        return 0;
-      }
-      if (len == 1) {
-        return 1;
-      }
-      if (len == 2) {
-        return 2;
-      }
-
-      List<Integer> a = new ArrayList();
-      a.add(nums[0]);
-      a.add(nums[1]);
-      for (int i = 2; i < len; i++) {
-        if (nums[i] != nums[i - 1]) {
-          a.add(nums[i]);
-        } else if (nums[i] != nums[i - 2]) {
-          a.add(nums[i]);
+    public static class Solution1 {
+        public int removeDuplicates(int[] nums) {
+            int counter = 0;
+            int len = nums.length;
+            if (len == 0) {
+                return 0;
+            }
+            if (len == 1) {
+                return 1;
+            }
+            if (len == 2) {
+                return 2;
+            }
+
+            List<Integer> a = new ArrayList();
+            a.add(nums[0]);
+            a.add(nums[1]);
+            for (int i = 2; i < len; i++) {
+                if (nums[i] != nums[i - 1]) {
+                    a.add(nums[i]);
+                } else if (nums[i] != nums[i - 2]) {
+                    a.add(nums[i]);
+                }
+            }
+
+            counter = a.size();
+            for (int i = 0; i < counter; i++) {
+                nums[i] = a.get(i);
+            }
+            return counter;
         }
-      }
-
-      counter = a.size();
-      for (int i = 0; i < counter; i++) {
-        nums[i] = a.get(i);
-      }
-      return counter;
     }
-  }
 
 }
