Added

Author: gahogg

Remove Duplicates from Sorted Array - Leetcode 26/Remove Duplicates from Sorted Array - Leetcode 26.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        if (nums.empty()) return 0;
+        int j = 1;
+        for (int i = 1; i < nums.size(); i++) {
+            if (nums[i] != nums[i - 1]) {
+                nums[j] = nums[i];
+                j++;
+            }
+        }
+        return j;
+    }
+};

Remove Duplicates from Sorted Array - Leetcode 26/Remove Duplicates from Sorted Array - Leetcode 26.java

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

Remove Duplicates from Sorted Array - Leetcode 26/Remove Duplicates from Sorted Array - Leetcode 26.js

@@ -0,0 +1,11 @@
+var removeDuplicates = function(nums) {
+    if (nums.length === 0) return 0;
+    let j = 1;
+    for (let i = 1; i < nums.length; i++) {
+        if (nums[i] !== nums[i - 1]) {
+            nums[j] = nums[i];
+            j++;
+        }
+    }
+    return j;
+};

Remove Duplicates from Sorted Array - Leetcode 26/Remove Duplicates from Sorted Array - Leetcode 26.py

@@ -0,0 +1,13 @@
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        n = len(nums)
+        j = 1
+        for i in range(1, n):
+            if nums[i] != nums[i-1]:
+                nums[j] = nums[i]
+                j += 1
+        
+        return j
+        
+        # Time: O(n)
+        # Space: O(1)

Remove Element - Leetcode 27/Remove Element - Leetcode 27.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int removeElement(vector<int>& nums, int val) {
+        int i = 0, n = nums.size();
+
+        while (i < n) {
+            if (nums[i] == val) {
+                nums[i] = nums[n - 1];
+                n--;
+            } else {
+                i++;
+            }
+        }
+        return n;
+    }
+};

Remove Element - Leetcode 27/Remove Element - Leetcode 27.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int removeElement(int[] nums, int val) {
+        int i = 0, n = nums.length;
+
+        while (i < n) {
+            if (nums[i] == val) {
+                nums[i] = nums[n - 1];
+                n--;
+            } else {
+                i++;
+            }
+        }
+        return n;
+    }
+}

Remove Element - Leetcode 27/Remove Element - Leetcode 27.js

@@ -0,0 +1,14 @@
+var removeElement = function(nums, val) {
+    let i = 0;
+    let n = nums.length;
+
+    while (i < n) {
+        if (nums[i] === val) {
+            nums[i] = nums[n - 1];
+            n--;
+        } else {
+            i++;
+        }
+    }
+    return n;
+};

Remove Element - Leetcode 27/Remove Element - Leetcode 27.py

@@ -0,0 +1,15 @@
+class Solution:
+    def removeElement(self, nums: List[int], val: int) -> int:
+        i = 0
+        n = len(nums)
+
+        while i < n:
+            if nums[i] == val:
+                nums[i] = nums[n - 1]
+                n -= 1
+            else:
+                i += 1
+        return n
+
+        # Time: O(n)
+        # Space: O(1)