Create find-minimum-in-rotated-sorted-array-ii.cpp

Author: kamyu104

C++/find-minimum-in-rotated-sorted-array-ii.cpp

@@ -0,0 +1,24 @@
+// Time:  O(logn)
+// Space: O(1)
+
+class Solution {
+public:
+    int findMin(vector<int>& nums) {
+        int left = 0, right = nums.size() - 1;
+
+        // Find min left s.t. nums[left] < nums[left'].
+        while (left < right && nums[left] >= nums[right]) {
+            int mid = left + (right - left) / 2;
+            if (nums[mid] == nums[left]) {
+                ++left;
+            } else if (nums[mid] < nums[left]) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+
+        return nums[left];
+
+    }
+};