competative/SearchInRotatedSortedArray.cpp at master · vijaylaxmi26/competative · 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include<bits/stdc++.h>
using namespace std;
int search(vector<int>& nums, int target) {
        int l=0,r=nums.size()-1,mid=0;

        if(nums.size()<=2){
            for(int i=0;i<nums.size();i++){
                if(target==nums[i]){
                    return i;
                }
            }
            return -1;
        }

        if(nums[0]<nums[nums.size()-1]){
            //cout<<"1"<<endl;
            while(l<=r){
                mid=(l+r)/2;
                if(target==nums[mid]){
                    return mid;
                }else if(target>nums[mid]){
                    l=mid+1;
                }else{
                    r=mid-1;
                }
            }
            return -1;
        }

        while(l<=r){
            mid=(l+r)/2;
            //cout<<l<<" "<<r<<endl;
            if(mid==0){
                if(nums[mid]>nums[mid+1]){
                    break;
                }else{
                    l=mid+1;
                }
            }
            if(mid==nums.size()-1){
                if(nums[mid]<nums[mid-1]){
                    break;
                }else{
                    r=mid-1;
                }
            }
            if((nums[mid]>nums[mid+1]) && (nums[mid]>nums[mid-1]) ){
                break;
            }else if(nums[l]>nums[mid]){
                r=mid;
            }else if(nums[r]<nums[mid]){
                l=mid+1;
            }

            //cout<<mid<<endl;
        }

        l=0;
        r=nums.size()-1;
        if(nums[l]<=target && target<=nums[mid]){
            r=mid;
        }else{
            l=mid+1;
        }

        while(l<=r){
                mid=(l+r)/2;
                if(target==nums[mid]){
                    return mid;
                }else if(target>nums[mid]){
                    l=mid+1;
                }else{
                    r=mid-1;
                }
        }


        return -1;

}
int main(){


return 0;
}