Merge pull request #1 from longsizhuo123/main

龙龙

龙龙代码随想录/27. 移除元素.py

@@ -0,0 +1,10 @@
+from typing import List
+class Solution:
+    def removeElement(self, nums: List[int], val: int) -> int:
+        ind = 0
+        while ind < len(nums):
+            if nums[ind] == val:
+                nums.pop(ind)
+            else:
+                ind += 1
+        return len(nums)

龙龙代码随想录/704. 二分查找.py

@@ -0,0 +1,14 @@
+from typing import List
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        def recursion(nums, left, right, target):
+            if left > right:
+                return -1
+            mid = left + (left - right) // 2
+            if nums[mid] == target:
+                return mid
+            elif nums[mid] < target:
+                left = mid + 1
+            else:
+                right = mid - 1
+            return recursion(nums, left, right, target)