Problem-Solving-in-any-Language/SearchinRotatedSortedArray.cpp at main · hk513/Problem-Solving-in-any-Language · 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
// 33. Leetcode {MEDIUM}  [Array]

#include <bits/stdc++.h>
using namespace std;

class Solution
{
public:
    int search(vector<int> &nums, int target)
    {

        int n = nums.size();
        int lo = 0;
        int hi = n - 1;

        while (lo <= hi)
        {

            int mid = lo + (hi - lo) / 2;

            if (nums[mid] == target)
            {
                return mid;
            }

            if (nums[lo] <= nums[mid])
            {

                if (target >= nums[lo] && target <= nums[mid])
                {
                    hi = mid - 1;
                }
                else
                {
                    lo = mid + 1;
                }
            }
            else
            {

                if (target >= nums[mid] && target <= nums[hi])
                {
                    lo = mid + 1;
                }
                else
                {
                    hi = mid - 1;
                    ;
                }
            }
        }

        return -1;
    }
};