dsa-questions/LeetCode_34.cpp at main · atharvp25/dsa-questions · 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
//Use Modify Binary Search
class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int>arr={-1,-1};

        int left=0,right=nums.size()-1;


        while(left<=right){
            int mid=left+(right-left)/2;

            if(nums[mid]<target){
                left=mid+1;
            }
            else{
                if(nums[mid]==target){
                    arr[0]=mid;


                }
                right=mid-1;

            }
        }
        left=0;right=nums.size()-1;
        while(left<=right){
            int mid=left+(right-left)/2;

            if(nums[mid]>target){
                right=mid-1;
            }
            else{
                if(nums[mid]==target){
                    arr[1]=mid;

                }
                 left=mid+1;

            }
        }

        return arr;


    }
};