讲两个int 数组找出重复的数字 用最少的循环

        int a[] = {1,3};
        int b[] = {1,3,5};
        int size = a.length>b.length ?a.length:b.length;
        int valueA =0 ;
        int valueB =0;
        for(int i =0;i

	1010

	3210

  int b[] = {1,3,8,5};
        int a[] = {1,3,4,5,8};
        boolean flag = a.length>b.length ?true:false;
        int size = a.length>b.length ?a.length:b.length;
        Set setInt = new HashSet();
        for (int i=0; i