competetive-programming/firstAndLastposnofElementinSortedArray.cpp at main · kritsid/competetive-programming · 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
class Solution {
public:
    int firstOcc(vector<int>& nums, int target){
int s=0;
        int e=nums.size()-1;
        int mid=0;
        int p=-1;
        while(s<=e){
            mid=s+(e-s)/2;
            if(nums[mid]==target){
            p=mid;
                e=mid-1;
            }
              if(nums[mid]>target){

                e=mid-1;
            }
               if(nums[mid]<target){

                s=mid+1;
            }

        }
        return p;
    }
        int lastOcc(vector<int>& nums, int target){
int s=0;
        int e=nums.size()-1;
        int mid=0;
        int p=-1;
        while(s<=e){
            mid=s+(e-s)/2;
            if(nums[mid]==target){
            p=mid;
                s=mid+1;
            }
              if(nums[mid]>target){

                e=mid-1;
            }
               if(nums[mid]<target){

                s=mid+1;
            }

        }
        return p;
    }

    vector<int> searchRange(vector<int>& nums, int target) {
      vector<int> ans;
        ans.push_back(firstOcc(nums,target));
        ans.push_back(lastOcc(nums,target));
        return ans;
    }
};