add solutions for Remove-Duplicates-from-Sorted-Array

Remove-Duplicates-from-Sorted-Array/Solution.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int removeDuplicates(int A[], int n) {
+        int anchor = 0;
+
+        for (int i = 0; i < n; i++, anchor++) {
+            for (; i + 1 < n && A[i] == A[i+1]; i++);
+            if (i + 1 < n) {
+                A[anchor + 1] = A[i + 1];
+            }
+        }
+        return anchor;
+    }
+};
+
+int main() {
+  return 0;
+}

Remove-Duplicates-from-Sorted-Array/Solution.java

@@ -0,0 +1,13 @@
+public class Solution {
+    public int removeDuplicates(int[] A) {
+        int anchor = 0;
+
+        for (int i = 0; i < A.length; i++, anchor++) {
+            for (; i + 1 < A.length && A[i] == A[i+1]; i++);
+            if (i + 1 < A.length) {
+                A[anchor + 1] = A[i + 1];
+            }
+        }
+        return anchor;
+    }
+}

Remove-Duplicates-from-Sorted-Array/Solution.py

@@ -0,0 +1,14 @@
+class Solution:
+    # @param a list of integers
+    # @return an integer
+    def removeDuplicates(self, A):
+        anchor = 0
+        i = 0
+        while i < len(A):
+            while i + 1 < len(A) and A[i] == A[i + 1]:
+                i += 1
+            if i + 1 < len(A):
+                A[anchor + 1] = A[i + 1]
+            anchor += 1
+            i += 1
+        return anchor