Replace with the right solution due to the mismatch of file and solutions

Author: SamTheKorean

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

@@ -1,25 +1,28 @@
-# TC : O(n) - Where it takes the length n of input list
-# SC : O(1) - Only a few extra variables are used regardless of input size
-class Solution:
-    def findMin(self, nums: List[int]) -> int:
-        for i in range(len(nums) - 1):
-            if nums[i] > nums[i + 1]:
-                return nums[i + 1]
-        return nums[0]
+# O(log n)
+# O(1)
 
 
-# TC: O(log(n)) - The search space is halved each round until the minimum is found
-# SC: O(1) - Only a few extra variables are used regardless of input size
 class Solution:
-    def findMin(self, nums: List[int]) -> int:
-        low, high = 0, len(nums) - 1
+    def search(self, nums: List[int], target: int) -> int:
+        left, right = 0, len(nums) - 1
+
+        while left <= right:
+            mid = (left + right) // 2
 
-        while low < high:
-            mid = (high + low) // 2
+            if nums[mid] == target:
+                return mid
 
-            if nums[mid] > nums[high]:
-                low = mid + 1
+            # Check if left half is sorted
+            if nums[left] <= nums[mid]:
+                if nums[left] <= target < nums[mid]:
+                    right = mid - 1
+                else:
+                    left = mid + 1
+            # Otherwise, right half is sorted
             else:
-                high = mid
+                if nums[mid] < target <= nums[right]:
+                    left = mid + 1
+                else:
+                    right = mid - 1
 
-        return nums[low]
+        return -1