#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> res(2, -1);
int i = 0, j = nums.size();
int mid = (i + j) / 2;
int p = -1;
while (i < j) {
if (nums[mid] == target) {
p = mid;
break;
}
if (nums[mid] > target) {
if (j == mid) break;
j = mid;
mid = (i + j) / 2;
}
else {
if (i == mid) break;
i = mid;
mid = (i + j) / 2;
}
}
if (p == -1) {
return res;
}
else {
int a = p, b = p;
while (a > 0 && nums[a - 1] == target) a--;
while (b < nums.size() - 1 && nums[b + 1] == target) b++;
vector<int> h;
h.push_back(a);
h.push_back(b);
return h;
}
}
};
int main(){
vector<int> a = { 5, 7, 7, 8,8,8, 8, 10 };
Solution s;
vector<int> b = s.searchRange(a, 7);
for (int i = 0; i < b.size(); i++){
cout << b[i];
}
return 0;
}