简单算法编写:
#include <iostream>
#include <cstdio>#include <algorithm>
using namespace std;
const int maxn = 100+10;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)&&(n+m!=0)){
int a[maxn]={0},b[maxn]={0},count = 0;
int c[maxn]={0},num=0;
for (int i=0; i<n; i++)
cin>>a[i];
sort(a,a+n);
for (int i=0; i<m; i++)
cin>>b[i];
sort(b,b+m);
for (int i=0; i<n; i++){
int flag=0,j;
for (j=0; j<m; j++){
if (a[i]==b[j]){
flag = 1;
}
}
if (flag == 0){
c[num]=a[i];
num++;
}
}
if (num==0||n==0)
cout<<"NULL"<<endl;
else{
for(int i=0; i<num; i++)
cout<<c[i]<<" ";
cout<<endl;
}
}
return 0;
}
使用集合更加简单
#include <iostream>
#include <set>
using namespace std;
int main()
{
int n,m;
while ((scanf("%d%d",&n,&m))&&(n+m!=0)){
int num,flag=0; set<int> s1; set<int> s2;
for (int i=0; i<n; i++){
scanf("%d",&num);
s1.insert(num); //将输入的数字放到集合s1中同时自动给数据排序
}
for (int i=0; i<m; i++){
cin>>num;
s2.insert(num);
}
for (set<int>::iterator a = s1.begin(); a != s1.end(); a++){
if (!s2.count(*a)){ //判断是否有这个数 有返回真
flag = 1;
cout<<*a<<" ";
}
}
if (flag == 0)
cout<<"NULL";
cout<<endl;
}
return 0;
}