找数组中某个元素的首尾位置

#include
#include
using namespace std;
class Solution {
public: vectorseachRange(vector&nums, int target)
{
vectorarr;
int len = size(nums);
if (nums.empty())
{
arr.push_back(-1);
arr.push_back(-1);
return arr;
}
auto p = &nums[0];
auto q = &nums[len - 1];
int count1 = 0;
while (count1<len)
{
if (*p == target)
{
arr.push_back(count1);
break;
}
p++;
count1++;
}
int count2 = len-1;
while (count2>=0)
{
if (*q == target)
{
arr.push_back(count2);
break;
}
q–;
count2–;
}
if (count1 == len)
{
arr.push_back(-1);
arr.push_back(-1);
}
return arr;
}
};
int main()
{
int n = 0;
cout << "please input the lenth of the array: ";
cin >> n;
vectorarr(n);
for (int& a : arr)
cin >> a;
Solution s;
int target=0;
cout << "please Enter the elemt that you found: ";
cin >> target;
for (int a : s.seachRange(arr,target))
{
cout << a;
}
return 0;
}