@@ -0,0 +1,453 @@
+class RemoveDuplicates %7B%0A  // decompose problem: remove duplicate, use counter to allow two duplicates%0A  public int removeDuplicates(int%5B%5D nums) %7B%0A    int current = 0;%0A    int counter = 0;%0A    for (int i = 1; i %3C nums.length; i++) %7B%0A      if (nums%5Bcurrent%5D != nums%5Bi%5D) %7B%0A        nums%5B++current%5D = nums%5Bi%5D;%0A        counter = 0;%0A      %7D else if (couter %3C 1) %7B%0A        nums%5B++current%5D = nums%5Bi%5D;%0A        counter++;%0A      %7D%0A    %7D%0A    return ++current;%0A  %7D%0A%7D

Add solution 80