refactor 80

fishercoder1534 · fishercoder1534 · commit 3f44e8c005c5 · 2018-02-16T08:29:27.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_80.java b/src/main/java/com/fishercoder/solutions/_80.java
@@ -1,8 +1,11 @@
 package com.fishercoder.solutions;
 
 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?
 
@@ -14,36 +17,37 @@
  */
 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;
-        }
-
-        ArrayList<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);
+      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]);
         }
+      }
 
-        return counter;
+      counter = a.size();
+      for (int i = 0; i < counter; i++) {
+        nums[i] = a.get(i);
+      }
+      return counter;
     }
+  }
 
 }
