/**
* .获取两个字符串数组交集.
* @param strArrA
* @param strArrB
* @return
* @author alm02.
*/
public static String[] GetIntersection(String [] strArrA, String [] strArrB) {
Map<String,Boolean> map = new HashMap<String,Boolean>();
List<String> list = new LinkedList<String>();
String [] resultArr = {};
// strA作为key,falue作为value插入map.
for(String strA : strArrA) {
if(!map.containsKey(strA)) {
map.put(strA, Boolean.TRUE);
}
}
// strB检索map中是否存在重复值,如果存在就设置为true.
for(String strB: strArrB) {
if(!map.containsKey(strB)) {
map.put(strB, Boolean.TRUE);
}
}
// getKey==true,addToList.
for (Map.Entry<String,Boolean> entry:map.entrySet()){
if (entry.getValue().equals(Boolean.TRUE)){
list.add(entry.getKey());
}
}
return list.toArray(resultArr);
}