find minimum in rotated sorted array

Author: eunhwa99

find-minimum-in-rotated-sorted-array/eunhwa99.java

@@ -0,0 +1,17 @@
+class Solution {
+  // TC: O(log N)
+  // SC: O(1)
+  public int findMin(int[] nums) {
+    int left = 0;
+    int right = nums.length - 1;
+    while (left < right) {
+      int mid = left + (right - left) / 2;
+      if (nums[mid] < nums[right]) {
+        right = mid;
+      } else {
+        left = mid + 1;
+      }
+    }
+    return nums[left];
+  }
+}