Time: 47 ms (28.91%) | Memory: 16.9 MB (83.23%) - LeetSync

swolecoder · swolecoder · commit c74b1d488317 · 2024-06-14T20:54:53.000-07:00
diff --git a/33-search-in-rotated-sorted-array/search-in-rotated-sorted-array.py b/33-search-in-rotated-sorted-array/search-in-rotated-sorted-array.py
@@ -1,16 +1,15 @@
 class Solution:
     def search(self, nums: List[int], target: int) -> int:
-        l = 0 
+        l = 0
         r = len(nums)-1
 
         while l <= r:
-
-            mid = ( l +r)//2
+            mid = ( l + r) //2
 
             if nums[mid] == target:
                 return mid
-
             
+
             if nums[mid] < nums[r]:
                 if nums[mid] <= target <= nums[r]:
                     l = mid +1
@@ -21,6 +20,6 @@ def search(self, nums: List[int], target: int) -> int:
                     r = mid -1
                 else:
                     l = mid +1
-        return -1
 
-        
+        return -1
+         
