leetcode-questions/34first_last_position_of_target.cpp at main · adityagaikwad888/leetcode-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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <stdc++.h>
using namespace std;
class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
           vector<int> temp;

           int s = 0;
           int ans = -1,ans1 = -1;
           int e = nums.size()-1;
           int mid ;
           while (s<=e)
           {
              mid = (s+e)/2;
              if(nums.at(mid)<target)
              {
                  s = mid + 1;

              }
              else if(nums.at(mid)>target)
              {
                  e = mid - 1;

              }
              else if(nums.at(mid)==target)
              {
                 ans = mid;
                 e = mid -1 ;
              }

           }

           s = 0;
           e = nums.size()-1;

           while (s<=e)
           {
              mid = (s+e)/2;
              if(nums.at(mid)<target)
              {
                  s = mid + 1;

              }
              else if(nums.at(mid)>target)
              {
                  e = mid - 1;

              }
              else if(nums.at(mid)==target)
              {
                 ans1 = mid;
                 s = mid + 1 ;
              }

           }
           temp.push_back(ans);
           temp.push_back(ans1);
           return temp;

    }
};