Java:法一扫描
import java.util.ArrayList;
public class Solution {
public int minNumberInRotateArray(int [] array) {
for(int i=0;i<array.length-1;i++){
if(array[i]>array[i+1])
return array[i+1];
}
return array[0];
}
}
c++:
class Solution {
public:
int findMin(vector<int>& nums) {
for(int i=0;i<nums.size()-1;i++){
if(nums[i]>nums[i+1]) return nums[i+1];
}
return nums[0];
}
};