【题目】
Suppose an array sorted in ascending order 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 index=0;
for(int i=0;i<nums.length-1;i++){
if(nums[i]>nums[i+1])
index=i+1;
}
return nums[index];
}
}
【参考】
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/#/description