154. Find Minimum in Rotated Sorted Array II (java)

Author: bluesword12350

Diff for: solution/0154.Find Minimum in Rotated Sorted Array II/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int findMin(int[] nums) {
+        int left = 0 , right = nums.length - 1;
+        while(left < right){
+            int mid = left + (right - left) / 2;
+            if(nums[left] > nums[mid]){
+                left++;
+                right = mid;
+            }else if(nums[mid] > nums[right]) left = mid + 1;
+            else right--;
+        }
+        return nums[left];
+    }
+}