//取两个数组的交集
private String[] intersect(String[] arr1, String[] arr2){
if (CheckUtils.isEmpty(arr1) && CheckUtils.isEmpty(arr2)) {
return null;
}
if (CheckUtils.isEmpty(arr1)) {
return arr2;
}
if (CheckUtils.isEmpty(arr2)) {
return arr1;
}
List<String> l2 = Arrays.asList(arr2);
String[] result = new String[arr1.length >= arr2.length ? arr1.length : arr2.length];
for (int i = 0; i < arr1.length; i++) {
if (l2.contains(arr1[i])) {
result[i] = arr1[i];
}
}
return result;
}
//判空方法
public static boolean isEmpty(Object obj) {
if (obj == null) {
return true;
}
if (obj instanceof String && obj.toString().trim().length() == 0) {
return true;
}
if (obj.getClass().isArray() && Array.getLength(obj) == 0) {
return true;
}
if (obj instanceof Collection && ((Collection) obj).isEmpty()) {
return true;
}
if (obj instanceof Map && ((Map) obj).isEmpty()) {
return true;
}
return false;
}