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

Author: jinhyungrhee

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

@@ -0,0 +1,17 @@
+class Solution {
+    public int findMin(int[] nums) {
+        int left = 0, right = nums.length - 1;
+        // 오름차순인 경우 
+        if (nums[left] < nums[right]) return nums[left];
+        // 오름차순이 아닌 경우 이진탐색
+        while (left < right) {
+            int mid = (left + right) / 2;
+            if (nums[mid] < nums[right]) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return nums[left];
+    }
+}