CODES/first_last_position_in_array.cpp at main · Kriti1262/CODES · 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
class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target)
    {
        if(nums.size()==0)
        {
            return {-1,-1};
        }
        int i,j,mid;
        i=0;
        j=nums.size()-1;
        int left=-1,right=-1;

        while(i<=j)
        {
            mid=(i+j)/2;
            if(nums[mid]>target)
            {
                j=mid-1;

            }else if(nums[mid]<target)
            {
             i=mid+1;
            }else
            {
                left=mid;
                j=mid-1;
            }
        }
         i=0;
        j=nums.size()-1;
        while(i<=j)
        {
            mid=(i+j)/2;
            if(nums[mid]>target)
            {
                j=mid-1;

            }else if(nums[mid]<target)
            {
             i=mid+1;
            }else
            {
                right=mid;
                i=mid+1;
            }
        }
        vector<int>ans;
        ans.push_back(left);
        ans.push_back(right);
        return ans;
    }
};