LeetCode – Refresh – Find Minimum in Rotated Array II

lazy solutions..... Just skip the duplicates. Then worse case of time is O(n).

 

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