Find Minimum in Rotated Sorted Array

题目：

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.

代码：九章算法的模板

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