@@ -0,0 +1,474 @@
+public class Solution %7B%0A    public int removeDuplicates(int%5B%5D nums) %7B%0A        if(nums.length == 0) return 0;%0A        boolean added = false;%0A        int index = 1;%0A        for(int i=1; i%3Cnums.length; i++)%7B%0A            if(nums%5Bi%5D == nums%5Bi-1%5D)%7B%0A                if(!added) %7Bnums%5Bindex++%5D = nums%5Bi%5D;%7D%0A                added = true;%0A            %7D else %7B%0A                added = false;%0A                nums%5Bindex++%5D = nums%5Bi%5D;%0A            %7D%0A        %7D%0A        return index;%0A    %7D%0A%7D%0A

Create Remove_Duplicates_from_Sorted_Array_II.java