Initial commit

Easy/remove-duplicates-from-sorted-array/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int k = 0;
+        for (int i = 0, last = -101; i < nums.length; ++i) {
+            if (last != nums[i]) {
+                nums[k++] = nums[i];
+                last = nums[i];
+            }
+        }
+
+        return k;
+    }
+}

Easy/remove-duplicates-from-sorted-array/solution.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+#include <unordered_set>
+#include <vector>
+
+class Solution {
+  public:
+    int removeDuplicates(std::vector<int> &nums) {
+        int k = 0, l = INT32_MIN;
+        for (auto iter = nums.begin(); iter != nums.end(); iter.operator++()) {
+            if (l != *iter) {
+                nums[k++] = *iter;
+                l = *iter;
+            }
+        }
+
+        return k;
+    }
+};