c_cpp 153.在旋转分类数组中查找最小值

Posted 2021-05-14

class Solution {
public:
    int findMin(vector<int>& nums) {
        if(nums.size() <= 1)
            return nums[0];
        for(int i = 0;i < nums.size()-1;i++){
            if(nums[i+1] < nums[i])
                return nums[i+1];
        }
        return nums[0];
    }
};

//使用二分法进行查找
class Solution {
public:
    int findMin(vector<int>& nums) {
        if(nums.size() <= 1)
            return nums[0];
        int start = 0;
        int end = nums.size() - 1;
        int mid = start;
        
        while(nums[start] >= nums[end]){
            if(end - start == 1){
                mid = end;
                break;
            }
            mid = (start + end)/2;
            if(nums[mid] >= nums[start])
                start = mid;
            else if(nums[mid] <= nums[end])
                end = mid;
        }
        
        return nums[mid];
    }
};

//0ms 最优算法

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