@@ -0,0 +1,345 @@
+public class Solution %7B%0A%0A    public int removeDuplicates(int%5B%5D nums) %7B%0A%0A        int curIndex = 0;%0A%0A        for (int i = 1; i %3C nums.length; i++) %7B%0A%0A            if (nums%5Bi%5D != nums%5BcurIndex%5D) %7B%0A                curIndex++;%0A                nums%5BcurIndex%5D = nums%5Bi%5D;%0A            %7D%0A%0A        %7D%0A%0A        curIndex++;%0A%0A        return curIndex;%0A%0A    %7D%0A%0A%7D%0A

Create : 26 Remove Duplicates from Sorted Array