[최원준] 2026/10/08

leetcode3/최원준/26. Remove Duplicates from Sorted Array.py

@@ -0,0 +1,18 @@
+class Solution:
+    def removeDuplicates(self, nums: list[int]) -> int:
+        index = 0
+        visited = set()
+        n = len(nums)
+        count = 0
+        for i in range(n):
+            num = nums[i]
+            if num in visited:
+                continue
+
+            visited.add(num)
+            nums[index] = num
+            index+=1
+            count+=1
+
+        return count
+

leetcode3/최원준/88. Merge Sorted Array.py

@@ -0,0 +1,21 @@
+class Solution:
+    def merge(self, nums1: list[int], n: int, nums2: list[int], m: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        n1, n2 = len(nums1), len(nums2)
+        index1, index2 = n-1, m-1
+        insert_index = len(nums1)-1
+
+        while insert_index >= 0:
+            num1 = nums1[index1] if index1>=0 else -float('inf')
+            num2 = nums2[index2] if index2>=0 else -float('inf')
+
+            if num1 > num2:
+                nums1[insert_index] = num1
+                index1-=1
+            else:
+                nums1[insert_index] = num2
+                index2-=1
+
+            insert_index-=1