?LeetCode刷題實(shí)戰(zhàn)153：尋找旋轉(zhuǎn)排序數(shù)組中的最小值
Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
[4,5,6,7,0,1,2] if it was rotated 4 times.
Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].
Given the sorted rotated array nums, return the minimum element of this array.
題意
示例 1：
輸入：nums = [3,4,5,1,2]
輸出：1
示例 2：
輸入：nums = [4,5,6,7,0,1,2]
輸出：0
示例 3：
輸入：nums = [1]
輸出：1
解題
思路：二分查找
public?int?findMin(int[] nums)?{
????int?left = 0;
????int?right = nums.length - 1;
????while(left < right){
????????int?mid = left + (right - left) / 2;
????????if(nums[mid] < nums[right]){
????????????right = mid;
????????}else{
????????????left = mid + 1;
????????}
????}
????return?nums[left];
}