如何把两个数组进行合并，并删除它们的相同元素

//String []
public static String[] HeBingArray(String[] a,String[] b){
String[] c = new String[a.length+b.length-cf(a,b)*2];
int index = 0;
for (int i=0;i<a.length;i++)
{
if (!isExist(b,a[i]))
{
c[index++] = a[i];
}
}
for (int i=0;i<b.length;i++)
{
if (!isExist(a,b[i]))
{
c[index++] = b[i];
}
}
return c;
}
public static int cf(String[] a,String [] b){
int num = 0;
for (int i=0;i<a.length;i++)
{
if (isExist(b,a[i]))
{
num++;
}
}
return num;
}
public static boolean isExist(String[] a,String s){
boolean d = false;
for (int i=0;i<a.length;i++)
{
if (s==a[i])
{
d = true;
}
}
return d;
}

//int []
public static int[] HeBingArray(int[] a,int[] b){
int[] c = new int[a.length+b.length-cf(a,b)*2];
int index = 0;
for (int i=0;i<a.length;i++)
{
if (!isExist(b,a[i]))
{
c[index++] = a[i];
}
}
for (int i=0;i<b.length;i++)
{
if (!isExist(a,b[i]))
{
c[index++] = b[i];
}
}
return c;
}
public static int cf(int[] a,int [] b){
int num = 0;
for (int i=0;i<a.length;i++)
{
if (isExist(b,a[i]))
{
num++;
}
}
return num;
}
public static boolean isExist(int[] a,int s){
boolean d = false;
for (int i=0;i<a.length;i++)
{
if (s==a[i])
{
d = true;
}
}
return d;
}

//测试
public static void main(String[] args) {
//int
int[] a={10,20,30,40,50};
int[] b={10,20,40};
int[] c=HeBingArray(a,b);
for (int i=0;i<c.length;i++)
{
System.out.print(c[i]+" ");
}

//String
// String[] a={"10","20","30","40","50"};
// String[] b={"10","20","40"};
// String[] c=HeBingArray(a,b);
// for (int i=0;i<c.length;i++)
// {
// System.out.print(c[i]+" ");
// }

}