求一个算法，2个1维数组互相查找里面是否有不同的数据

Question

String[] a = {"a","b","c","d","e","f","g","h","i","j","",""};
String[] b = {"f","a","c","f","e","k","l","y","p","o","",""};如果b里面的数据在a里面没有，则把没有的数据放到""里面，超过的话，则报错~~

Answer 1

集合运算 不知道 java支持么。

Answer 2

用数组做好相比较麻烦
如果用Set接口做合并应该比较简单
不过长度的限制只能自己控制了

Answer 3

帮你写了一个,算法不是很好：class FindChar
{

public static void main(String [] args)
{
String[] a = {"a","b","c","d","e","f","g","h","i","j","",""};
String[] b = {"f","a","c","f","e","k","l","y","p","o","",""}; 

for(int i=0;i<b.length;i++)
{
boolean sign=false;
for(int j=0;j<a.length;j++)
{
if(b[i].equals(a[j]))
{
sign=true;
break;
}
}

if(!sign)
insert(b[i],a);
}

for(int m=0;m<a.length;m++)
System.out.println("a["+m+"]="+a[m]);
}

public static void insert(String yy,String [] vv)
{
for(int k=0;k<vv.length;k++)
{
if(vv[k]=="")
{
vv[k]=yy;
break;
}
else
System.out.println("已经满了，无法插入");
}
}

}

Answer 4

先谢谢鸡汤了哈...我用的也是类似的方法,不过觉得有点笨,所以上来求一个好些的算法....
双层for循环效率太低了啊...

Answer 5

HashSet或者HashMap，条件就是数组中元素不能重复

                  set.addAll(Arrays.asList(a));
set.addAll(Arrays.asList(b));
set.remove("");
if(set.size() > a.length)
{
System.err.println("error insert value");
}
else
{
set.toArray(a);
for(int i =0;i<a.length;i++)
{
System.out.print(a[i]);
}
}

Answer 6

杀了一句
HashSet set = new HashSet(a.length);

Answer 7

先谢谢bigc2000(公元2005年4月9日) ,我去试以下看看效果哈~~~~