packagecom.wish.datastrustudy;importjava.util.HashSet;importjava.util.LinkedList;importjava.util.List;importjava.util.Set;public classStringArray {public static voidmain(String[] args) {//测试union
String[] arr1 = {"abc", "df", "abc","dd","bdfe"};
String[] arr2= {"abc", "cc", "df", "d", "abc"};
String[] result_union=union(arr1, arr2);
System.out.println("求并集的结果如下:");for(String str : result_union) {
System.out.println(str);
}//测试insect
String[] result_insect =intersect(arr1, arr2);
System.out.println("求交集的结果如下:");for(String str : result_insect) {
System.out.println(str);
}//测试 substract
String[] result_minus =substract(arr1, arr2);
System.out.println("求差集的结果如下:");for(String str : result_minus) {
System.out.println(str);
}
}//并集(set唯一性)
public staticString[] union (String[] arr1, String[] arr2){
Set hs = new HashSet();for(String str:arr1){
hs.add(str);
}for(String str:arr2){
hs.add(str);
}
String[] result={};returnhs.toArray(result);
}//交集(注意结果集中若使用LinkedList添加,则需要判断是否包含该元素,否则其中会包含重复的元素)
public staticString[] intersect(String[] arr1, String[] arr2){
List l = new LinkedList();
Set common = new HashSet();for(String str:arr1){if(!l.contains(str)){
l.add(str);
}
}for(String str:arr2){if(l.contains(str)){
common.add(str);
}
}
String[] result={};returncommon.toArray(result);
}//求两个数组的差集
public staticString[] substract(String[] arr1, String[] arr2) {
LinkedList list = new LinkedList();for(String str : arr1) {if(!list.contains(str)) {
list.add(str);
}
}for(String str : arr2) {if(list.contains(str)) {
list.remove(str);
}
}
String[] result={};returnlist.toArray(result);
}
}