求 交集

package net.okren.java;
import java.util.*;
public class Test {
	
	private static int count;

	public static void getInterSet(int[] a, int[] b){
		
		
		
		
		Set<Integer> set = new HashSet<Integer>();
		for(int i = 0; i < a.length; i++){
			set.add(a[i]);
		}
		
		for(int i = 0; i < b.length; i++){
			int setSize = set.size();
			
			if(i > 0){//如果重复
				if(b[i] == b[i - 1]){
					continue;
				}
			}
			set.add(b[i]);
			if(setSize == set.size()){
				b[count++] = b[i];
			}
			
		}
		
	}
	
	public static void main(String[] args){
		int[] a = {1,3,5,6,7,8,88};
		int[] b = {3,7,7,7,7,7,7,7,88,24,2424,2,424,42,5};
		getInterSet(a, b);
		for(int i = 0; i < count; i++)
		System.out.print(b[i] + " ");
	}
}