unclassing

Author: andrewlihk

Binary Search - Leetcode 704/Binary Search - Leetcode 704.py

@@ -1,19 +1,21 @@
-class Solution:
-    def search(self, nums: List[int], target: int) -> int:
-        left = 0
-        right = len(nums) - 1
 
-        while left <= right:
-            middle = (right + left) // 2
+def search(nums, target) -> int:
+    left = 0
+    right = len(nums) - 1
 
-            if nums[middle] == target:
-                return middle
-            elif nums[middle] > target:
-                right = middle - 1
-            else:
-                left = middle + 1
+    while left <= right:
+        middle = (right + left) // 2
 
-        return -1
+        if nums[middle] == target:
+            return middle
+        elif nums[middle] > target:
+            right = middle - 1
+        else:
+            left = middle + 1
+
+    return -1
+
+print(search([-1, 0, 3, 5, 9, 12], 9))
 
 # Time Complexity: O(log(n))
 # Space Complexity: O(1)

Binary Search - Leetcode 704/tempCodeRunnerFile.py

@@ -0,0 +1 @@
+List

Subsets - Leetcode 78/Subsets - Leetcode 78.py

@@ -1,23 +1,26 @@
-class Solution:
-    def subsets(self, nums: List[int]) -> List[List[int]]:
-        n = len(nums)
-        res, sol = [], []
 
-        def backtrack(i):
-            if i == n:
-                res.append(sol[:])
-                return
+def subsets(nums):
+    n = len(nums)
+    res, sol = [], []
 
-            # Don't pick nums[i]
-            backtrack(i + 1)
+    def backtrack(i):
+        if i == n:
+            res.append(sol[:])
+            return
 
-            # Pick nums[i]
-            sol.append(nums[i])
-            backtrack(i + 1)
-            sol.pop()
+        # Don't pick nums[i]
+        backtrack(i + 1)
 
-        backtrack(0)
-        return res
+        # Pick nums[i]
+        sol.append(nums[i])
+        backtrack(i + 1)
+        sol.pop()
+
+    backtrack(0)
+    return res
+
+print(subsets([1, 2, 3]))
 
 # Time Complexity: O(2^n)
 # Space Complexity: O(n)
+