leetcode Find Minimum in Rotated Sorted Array（需要复习）

public int findMin(int[] nums) {
int left=0;
int right=nums.length-1;
while(left<right)
{
int middle=(left+right)/2;
if(nums[middle]>nums[right])
{
left=middle+1;
}
else
{
right=middle-1;
}
}
return nums[right];
}