LeetCode/33.cpp at master · chinawch007/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
class Solution {
public:
    int search(vector<int>& nums, int target) {
        int len = nums.size();
        int s = 0, e = len-1;
        int b = nums[0];
        int t = -1;
        while(e>s)
        {
            int m = (s+e)/2;
            if(nums[m]>=b && nums[m+1]<b)
            {
                t = m;
                break;
            }

            if(nums[m] >= b && nums[m+1]>b)
            {
                s = m+1;
            }
            else
            {
                e = m-1;
            }
        }
        if(t == -1)t = s;
        cout << t << endl;

        if(target >= b)
        {
            s = 0;
            e = t;
        }
        else
        {
            s = t+1;
            e = len-1;
        }

        while(e>s)
        {
            int m = (e+s)/2;
            if(nums[m] == target)
            {
                return m;
            }
            else if(nums[m] > target)
            {
                e = m-1;
            }
            else
            {
                s = m+1;
            }
        }
        if(nums[e] == target)return e;
        else return -1;
    }
};