越界检查

int FindValue(int* br, int n, int val)
{
if (br == nullptr || n < 1) return -1;
int i = 0;
int pos = n-1;
while (pos >= 0 && br[pos] != val)//pos>=0当这条件不符合时后面的条件将不会再执行while ( br[pos] != val&&pos >= 0)
{
–pos;
}
return pos;
for (int i = 0; i < n; ++i)
{
if (val != br[i])continue;
else
{
return i;
}
}
return -2;
}
int main()//查找数组中的有无val这个数
{
const int n = 100;
int ar[n] = {};
int n=sizeof(ar) / sizeof(ar[0]);
FindValue(ar,n,val);
}