Skip to content

Commit 6a4c651

Browse files
authored
Update Find Minimum in Rotated Sorted Array - Leetcode 153.py
1 parent 010e46d commit 6a4c651

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

Find Minimum in Rotated Sorted Array - Leetcode 153.py

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -13,3 +13,6 @@ def findMin(self, nums: List[int]) -> int:
1313
r = m
1414

1515
return nums[l]
16+
17+
# Time Complexity: O(log(n))
18+
# Space Complexity: O(1)

0 commit comments

Comments
 (0)