Merge str1 and str2 into a new string [] and remove the repeated parts.

String [] str1 = {"1001", "1002", "1003 "};
String [] str2 = {"1001", "1005", "1010", "1003 "};
Vector v = new vector ();
For (INT I = 0; I <str1.length; I ++ ){
If (! V. Contains (str1 [I]) {
V. Add (str1 [I]);
}
}
For (INT I = 0; I <str2.length; I ++ ){
If (! V. Contains (str2 [I]) {
V. Add (str2 [I]);
}
}

String [] str1 = new string [] {"1001", "1002", "1003 "};
String [] str2 = new string [] {"1001", "1005", "1010", "1003 "};
Hashmap HP = new hashmap ();

For (INT I = 0; I <str1.length; I ++ ){
HP. Put (str1 [I], "");

}
For (INT I = 0; I <str2.length; I ++ ){
HP. Put (str2 [I], "");

}

Import java. util .*;

Public class test1
{

Public static void main (string [] ARGs)
{
String [] str1 = {"1001", "1002", "1003 "};
String [] str2 = {"1001", "1005", "1010", "1003 "};
Hashset SH = new hashset ();
For (INT I = 0; I <str1.length; I ++)
Sh. Add (str1 [I]);
For (Int J = 0; j <str2.length; j ++)
Sh. Add (str2 [J]);
Iterator I = Sh. iterator ();
While (I. hasnext ()){

System. Out. println (I. Next ());
}

}
}