[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
#include<iostream> using namespace std; int main() { int n,m; cin >> n; int a[n]
;//如果编译器不允许这样写 补充 //int* a =(int*)malloc(sizeof(int)*n); for(int i = 0; i < n; i
++) { cin >> a[i]; } cin >> m; int b[m]; for(int i = 0; i < m; i++) { cin >> b[i
]; } //指定两个和存放数据的等长的 判断数组 bool a1[n] = {false},b1[m] = {false};
//两个数组之间遍历，将出现的数字，全部置成true for(int i = 0; i < n; i++) { for(int j = 0; j < m; j
++) { if(a[i] == b[j]) { a1[i] = true; b1[j] = true; } } } //然后每个数组在分别自己遍历 for(
int i = 0; i < n; i++) { for(int j = i+1; j < n;j++) { if(a[i] == a[j]) { a1[j]
= true; } } } for(int i = 0; i < m; i++) { for(int j = i+1; j < m;j++) { if(b[i]
== b[j]) { b1[j] = true; } } } //注意输出格式 int flag2 = 1; for(int i = 0; i<n;i++) {
if(!a1[i]&&flag2==1) { cout << a[i]; flag2 = 0; } else if(!a1[i]&&flag2==0) {
cout<< ' ' << a[i]; } } if(flag2 == 0) for(int j = 0; j < m; j++) { if(!b1[j])
cout<< ' ' << b[j]; } else if(flag2 == 1) { int flag1 = 1; for(int j = 0; j < m;
j++) { if(!b1[j]&&flag1 == 1) { cout << b[j]; flag1=0; } else if(!b1[j]&&flag1
== 0) { cout << ' ' << b[j]; } } } return 0; }
