D. J.:

- Added leetcode problem and solution for 26. Remove Duplicates from Sorted Array

Author: nobodyPerfecZ

awesome_python_leetcode/_26_remove_duplicates_from_sorted_array.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        """
+        Given an integer array nums sorted in non-decreasing order,
+        remove the duplicates in-place such that each unique element appears only once.
+        The relative order of the elements should be kept the same. Then return the number of unique elements in nums.
+
+        Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:
+        - Change the array nums such that the first k elements of nums contain the unique elements in the order they
+        were present in nums initially. The remaining elements of nums are not important as well as the size of nums.
+        - Return k.
+        """
+        left, right, length, val_before = 1, 1, 1, nums[0]
+        while right < len(nums):
+            if val_before == nums[right]:
+                right += 1
+            else:
+                nums[left] = nums[right]
+                val_before = nums[left]
+                left += 1
+                right += 1
+                length += 1
+        return length

tests/test_26_remove_duplicates_from_sorted_array.py

@@ -0,0 +1,17 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._26_remove_duplicates_from_sorted_array import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 1, 2], [1, 2]),
+        ([0, 0, 1, 1, 1, 2, 2, 3, 3, 4], [0, 1, 2, 3, 4]),
+    ],
+)
+def test_func(nums: List[int], expected: List[int]):
+    length = Solution().removeDuplicates(nums)
+    assert nums[:length] == expected