practice_dsa/problems/cpp/arrays/SearchforaRange/sfr.cpp at main · Parihar07/practice_dsa · 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
#include<iostream>
#include<vector>

using namespace std;
vector<int> searchRange(const vector<int>& A, int B) {
  vector<int> ans;
  int s = 0, e = A.size() - 1, mid = -1;
  int fo = -1, lo =-1;
  while (s <= e)
  {
	mid = (s + e) / 2;
	if (A[mid] == B)
	{
	  fo = mid;
	  e = mid - 1;
	} else 	if (A[mid] < B)
	{
	  s = mid + 1;
	} else
	{
	  e = mid -1;
	}

  }
  ans.push_back(fo);
  s = 0, e = A.size() - 1, mid = -1;
  while (s <= e)
  {
	mid = (s + e) / 2;
	if (A[mid] == B)
	{
	  lo = mid;
	  s = mid + 1;
	}
	else if (A[mid] < B)
	{
	  s = mid + 1;
	}
	else
	{
	  e = mid - 1;
	}

  }
  ans.push_back(lo);

  return ans;
}
int main()
{
  vector<int> A = { 5, 7, 7, 8, 8, 10 };
  vector<int> B = { 5, 17, 100, 111 };
  cout << "Search range hello\n";

  vector<int> ans = searchRange(A, 8);
  for (auto i = ans.begin(); i != ans.end(); i++)
  {
	cout << *i << " ";
  }
  cout << endl;
  ans = searchRange(B, 3);
  for (auto i = ans.begin(); i != ans.end(); i++)
  {
	cout << *i << " ";
  }
  cout << endl;
  return 0;
}