add solution: find-minimum-in-rotated-sorted-array

DaleStudy · Feb 6, 2025 · 6e927c7 · 6e927c7
1 parent cf0eb38
commit 6e927c7
Showing 1 changed file with 15 additions and 0 deletions.
diff --git a/find-minimum-in-rotated-sorted-array/dusunax.py b/find-minimum-in-rotated-sorted-array/dusunax.py
@@ -0,0 +1,15 @@
+'''
+# 153. Find Minimum in Rotated Sorted Array
+
+## Time Complexity: O(n)
+- min() iterates through all elements to find the smallest one.
+
+## Space Complexity: O(1)
+- no extra space is used.
+'''
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        if len(nums) == 1:
+            return nums[0]
+
+        return min(nums)