LeetCode/154.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
public:
    int findMin(vector<int> &nums) {
        int l, r, mid;

        l = 0;
        r = nums.size()-1;

        while(l < r)
        {
            if(nums[l] < nums[r])
                break;

            mid = l + (r - l) / 2;

            if(nums[mid] > nums[r])
                l = mid + 1;
            else if(nums[l] == nums[mid])
            {
                while(nums[l] == nums[mid] && l != mid)
                    l++;

                while(nums[r] == nums[mid] && r != mid)
                    r--;
            }
            else
                r = mid;
        }

        return nums[l];
    }
};