数组查找
考虑问题一定要全面
#include<iostream>
using namespace std;
int main()
{
int n, m,i;
int array1[1000], array2[100];
cin >> n;
for (i = 0; i < n; i++)
cin >> array1[i];
cin >> m;
for (i = 0; i < m; i++)
cin >> array2[i];
int find = 0;
if (n != 1)
{
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (array2[i] == array1[j])
{
find = 1;
if (j == 0)
cout << array1[j + 1] << endl;
else if (j == n - 1)
cout << array1[j - 1] << endl;
else
cout << array1[j - 1] << " " << array1[j + 1] << endl;
}
}
if (find == 0)
cout << "NULL" << endl;
find = 0;
}
}
else//一定要考虑到n=1的情形————输出m个NULL
for(i=0