第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-492 集合运算

#include<stdio.h>

#define N 2000

int unite(int *a, int *b, int *c, int n, int m) {
    int i, j, k = 0;
    if (n >= m) {
        for (i = 0; i < n; i++) {
            for (j = 0; j < n; j++)
                if (a[i] == b[j])
                    c[k++] = a[i];
        }
    } else {
        for (i = 0; i < m; i++) {
            for (j = 0; j < n; j++)
                if (a[i] == b[j])
                    c[k++] = a[i];
        }
    }
    return k;
}

int join(int *a, int *b, int *d, int n, int m) {
    int i, j, t, k = 0, l = 0;
    for (i = 0; i < n; i++)
        d[k++] = a[i];
    for (i = 0; i < m; i++)
        d[k++] = b[i];
    for (i = 0; i < k; i++)
        for (j = 0; j < k - 1; j++)
            if (d[i] < d[j]) {
                t = d[i];
                d[i] = d[j];
                d[j] = t;
            }
    for (i = 0; i < k; i++)
        if (d[i] != d[i + 1])
            d[l++] = d[i];
    return l;
}

int complement(int *a, int *c, int *e, int n, int k) {
    int i, j, o = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < k; j++) {
            if (a[i] == c[j])
                a[i] = 0;
        }
    }
    for (i = 0; i < n; i++) {
        if (a[i] == 0)
            continue;
        else
            e[o++] = a[i];
    }
    return o;
}

int main() {
    int a[N], b[N], c[N], d[N], e[N];
    int i, n, m, k, l, o;
    scanf("%d", &n);
    for (i = 0; i < n; i++)
        scanf("%d", &a[i]);
    scanf("%d", &m);
    for (i = 0; i < m; i++)
        scanf("%d", &b[i]);
    k = unite(a, b, c, n, m);
    for (i = 0; i < k; i++)
        printf("%d ", c[i]);
    printf("\n");
    l = join(a, b, d, n, m);
    for (i = 0; i < l; i++)
        printf("%d ", d[i]);
    printf("\n");
    o = complement(a, c, e, n, k);
    for (i = 0; i < o; i++)
        printf("%d ", e[i]);
    printf("\n");
    return 0;
}

#include <iostream>
#include <set>
using namespace std;
set<int> sa,sb,sc; 
int main(int argc, char** argv) {
	int n,m;
	cin>>n;
	int num;
	for(int i=0;i<n;i++){
		cin>>num;
		sa.insert(num);
		sc.insert(num);
	}		
	cin>>m;
	for(int i=0;i<m;i++){
		cin>>num;
		sb.insert(num);
		sc.insert(num);
	}
	for(set<int>::iterator it=sb.begin();it!=sb.end();it++)
		if(sa.count(*it)) cout<<*it<<" ";
	cout<<endl;
	for(set<int>::iterator it=sc.begin();it!=sc.end();it++)
		cout<<*it<<" ";
	cout<<endl;
	for(set<int>::iterator it=sa.begin();it!=sa.end();it++)
		if(!sb.count(*it)) cout<<*it<<" ";
	cout<<endl;
	return 0;
}

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int []a=new int[n];
		for(int i=0;i<n;i++) {
			a[i]=sc.nextInt();
		}
		int m=sc.nextInt();
		int []b=new int[m];
		for(int i=0;i<m;i++) {
			b[i]=sc.nextInt();
		}
		for(int i:jiaoji(a, b)) {
			System.out.print(i+" ");
		}
		System.out.println();
		for(int i:bingji(a, b)) {
			System.out.print(i+" ");
		}
		System.out.println();
		for(int i:yuji(a, b)) {
			System.out.print(i+" ");
		}
	}
	public static List<Integer> bingji(int a[],int b[]) {
		List<Integer> c=new ArrayList<Integer>();
		for(int i=0;i<a.length;i++) {
			if(!c.contains(a[i])) {
				c.add(a[i]);
			}
		}
		for(int i=0;i<b.length;i++) {
			if(!c.contains(b[i])) {
				c.add(b[i]);
			}
		}
		c.sort(Comparator.naturalOrder());
		return c;
	}
	public static List<Integer> jiaoji(int a[],int b[]){
		List<Integer> c=new ArrayList<Integer>();
		List<Integer> b1=new ArrayList<Integer>();
		for(int i=0;i<b.length;i++) {
			b1.add(b[i]);
		}
		for(int i=0;i<a.length;i++) {
			if(b1.contains(a[i])) {
				c.add(a[i]);
			}
		}
		Collections.sort(c);
		return c;
	}
	public static List<Integer> yuji(int a[],int b[]){
		List<Integer> c=new ArrayList<Integer>();
		c=bingji(a, b);
		for(int i=0;i<b.length;i++) {
			if(c.contains(b[i])) {
				c.remove(Integer.valueOf(b[i]));
			}
		}
		return c;
	}
}

n=input()
a=set([int(i) for i in input().split()])
n2=input()
b=set([int(i) for i in input().split()])
L1=list(a&b)
L2=list(a|b)
L3=list(a-b)
L1.sort()
L2.sort()
L3.sort()
print(' '.join(list(map(str,L1))))
print(' '.join(list(map(str,L2))))
print(' '.join(list(map(str,L3))))