数组实现从求一个集合和子集的补集

数组实现从求一个集合和子集的补集

	//从求一个集合和子集的补集
public class demo {
	static int n=44;
	static int[] arr=new int[]{1420, 1198, 493, 300, 3006, 881, 2450, 1372, 3643, 1350, 598, 615, 740, 820, 841, 820, 1025, 885, 270, 270, 270, 270, 270, 1735, 885, 4719, 1661, 1435, 2255, 5895, 6465, 870, 330, 750, 1365, 2085, 3370, 1995, 7990, 381, 2048, 840, 6880, 7723};
	public static void main(String[] args) {

	int[] sub=new int[]{1420,270,270};
    int[] result= buji(sub);
    for (int i = 0; i < result.length; i++) {
		System.out.print(result[i]+" ");	
	}
    System.out.println();
    System.out.println(result.length);
	}
	public static int[] buji(int[] b){
		int[] arr2=new int[n];
	
		arr2=arr;
		for (int i = 0; i < b.length; i++) {
			for (int j = 0; j < arr2.length; j++) {
				if(b[i]==arr2[j]){
					arr2[j]=0;
					break;
				}
			}				
		}
		int k=arr.length-b.length;
	int[] c=new int[k];
	for (int i = 0,j=0; i < arr2.length; i++) {
		if(arr2[i]==0){
			continue;
		}
		if(j<k){
		c[j]=arr2[i];
		j++;
		}
	}
		return c;
		
	}
}