数组的交集与并集

#include <stdio.h>
#include <stdlib.h>

#define M 20
#define N 15

//交集
void main1() {
	int a[M] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20 };
	int b[N] = {11,12,13,14,15,16,17,18,19,20,21,22,23,24,25};
	int c[N] = { 0 };
	int ci = 0;
	for (int i = 0; i < N; i++) {
		int flag = 0;	//假定没有
		for (int j = 0; j < M; j++) {
			if (b[i] == a[j]) {
				flag = 1;
				break;
			}
		}
		if (flag != 0) {
			c[ci] = b[i];
			ci++;
		}
		
	}
	for (int i = 0; i < N; i++) {
		if (c[i]!=0) {
			printf("\n%d", c[i]);
		}
		
	}


	system("pause");
}

//并集
void main() {
	int a[M] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20 };
	int b[N] = { 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25 };
	int c[N+M] = { 0 };
	for (int i = 0; i < N; i++) {
		c[i] = b[i];
	}//先全部填充b[i]
	int ci = N;
	for (int i = 0; i < M; i++) {
		int flag = 0;//假定没有
		for (int j = 0; j < N; j++) {
			if (a[i] == b[j]) {
				flag = 1;
				break;
			}
		}
		if (!flag) {
			c[ci] = a[i];
			ci++;
		}
	}
	for (int i = 0; i < N+M; i++) {
		if (c[i] != 0) {
			printf("\n%d", c[i]);
		}

	}

	system("pause");
}