Add Find minimum in rotated sorted array Solution - s0ooo0k

Author: s0ooo0k

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

@@ -0,0 +1,19 @@
+class Solution {
+    /*
+     * 시간복잡도 O(log n)
+     */
+    public int findMin(int[] nums) {
+        int left = 0;
+        int right = nums.length-1;
+
+        while(left<right) {
+            int mid =(right - left)/2+left;
+            if(nums[right]<nums[mid]) {
+                left=mid+1;
+            }
+            else right=mid;
+        }
+        return nums[left];
+    }
+}
+