LeetCode/153.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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

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

        len = nums.size();

        l = 0; r = len-1;

        while(l <= r)
        {
            mid = l + ((r-l) / 2);

            if(nums[mid] > nums[l] && nums[mid] < nums[r])
                return nums[l];

            if(mid-1 >= l)
            {
                if(nums[mid-1] > nums[mid])
                    return nums[mid];
            }
            else
                return min(nums[l], nums[r]);

            if(mid+1 <= r)
            {
                if(nums[mid+1] < nums[mid])
                    return nums[mid+1];
            }
            else
                return min(nums[l], nums[r]);

            if(nums[mid] > nums[l])
            {
                l = mid + 1;
                continue;
            }
            else
            {
                r = mid - 1;
                continue;
            }
        }
    }
};

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

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

        while(l < r)
        {
            mid = l + ((r-l)/2);

            if(nums[mid] > nums[r])
                l = mid + 1;
            else
                r = mid;
        }

        return nums[l];
    }
};