find minimun in rotated sorted array solved

Author: sora0319

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

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