题解 | 找x
找x
https://www.nowcoder.com/practice/069e2130430c41229ab25e47fa0949a6
#include <iostream>
#include<vector>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
vector<int> vec(n);
for(int i = 0; i < n;++i)
{
scanf("%d",&vec[i]);
}
int x;
scanf("%d",&x);
int idx;
for(idx = 0; idx < n ; ++idx)
{
if(vec[idx] == x)
{
printf("%d\n",idx);
return 0;
}
}
if(idx == n)
{
printf("-1\n");
}
return 0;
}
查看12道真题和解析