- Search In Rotated Sorted Array #246

Author: ayosecu

search-in-rotated-sorted-array/ayosecu.py

@@ -0,0 +1,39 @@
+from typing import List
+
+class Solution:
+    """
+        - Time Complexity: O(logN), N = len(nums)
+        - Space Complexity: O(1)
+    """
+    def search(self, nums: List[int], target: int) -> int:
+        left, right = 0, len(nums) - 1
+
+        while left <= right:
+            mid = (left + right) // 2
+
+            if target == nums[mid]:
+                return mid
+            
+            if nums[left] <= nums[mid]:
+                if nums[left] <= target < nums[mid]:
+                    right = mid - 1
+                else:
+                    left = mid + 1
+            else:
+                if nums[mid] < target <= nums[right]:
+                    left = mid + 1
+                else:
+                    right = mid - 1
+        
+        return -1
+
+tc = [
+        ([4, 5, 6, 7, 0, 1, 2], 0, 4),
+        ([4, 5, 6, 7, 0, 1, 2], 3, -1),
+        ([1], 0, -1)
+]
+
+solution = Solution()
+for i, (n, t, e) in enumerate(tc, 1):
+    r = solution.search(n, t)
+    print(f"TC {i} is Passed!" if r == e else f"TC {i} is Failed! - Expected: {e}, Result: {r}")