Java集合的运算之减法A-B

import com.sun.media.sound.SoftSynthesizer;

import java.util.*;

 

public class a123 {

public static void main(String args[]) {

int m, n;

Scanner in = new Scanner(System.in);

while ((m = in.nextInt()) != 0 | (n = in.nextInt()) != 0) {

if (m <= 100 && n <= 100) {

int[] a = new int[m + n];

int[] flog = new int[100];

int[] temp = new int[100];

int k = 0;

for (int i = 0; i < m + n; i++)

a[i] = in.nextInt();

for (int i = 0; i < m; i++)

for (int j = m; j < m + n; j++) {

if (a[i] == a[j]) {

flog[i] = 1;

break;

}

}

int t = 0;

for (int i = 0; i < m; i++) {

if (flog[i] == 0) {

temp[k++] = a[i];

} else if (flog[i] == 1)

t++;

}

if (t != m) {

Arrays.sort(temp, 0, k);

System.out.print(temp[0]);

for (int i = 1; i < k - 1; i++) {

System.out.print(" " + temp[i]);

}

System.out.print(" " + temp[k - 1] + " ");

System.out.println();

} else

System.out.println("NULL");

} else

break;

}

}

}