题目描述:
对于两个整型数组arr1、arr2,其异或运算规则定义如下:
对于arr1或arr2中的某个元素X,如果X在arr1中出现N次,在arr2中出现M次,则结果中包含|N-M|个X,其中M,N>=0,请对arr1、arr2两个数组进行异或运算,把结果按照升序排列输出:
let arr1 = [1, 22, 3, 4, 55, 66,'zyk','zyk',true];
let arr2 = [11, 22, 33, 44,22,22,22,22,'zyk',false,false];
XOROperationArray(arr1, arr2);
function XOROperationArray(arr1, arr2) {
let resMap = getXORResult(arr1, arr2);
let resArray = resultFormatToArray(resMap);
resArray.sort((a,b)=>{
return a-b;
});
console.log(resArray);
return resArray;
}
function resultFormatToArray(resMap) {
let res = [];
resMap.forEach((value,key)=>{
if (value ===1) {
res.push(key);
} else {
for(let i=0;i<value;i++){
res.push(key);
}
}
});
return res;
}
function getXORResult(arr1, arr2) {
let resMap = new Map();
let resMap1 = getEleExistNumInArray(arr1);
let resMap2 = getEleExistNumInArray(arr2);
resMap1.forEach((value, key, currentMap) => {
if (resMap2.has(key)) {
let num = value - resMap2.get(key);
num = num >= 0 ? num : -num;
if (num !== 0) {
resMap.set(key, num);
}
} else {
resMap.set(key, value);
}
});
resMap2.forEach((value, key, currentMap) => {
if (!resMap1.has(key)) {
resMap.set(key, value);
}
});
return resMap;
}
function getEleExistNumInArray(arr) {
let res = new Map();
arr.forEach(ele => {
if (res.has(ele)) {
res.set(ele, res.get(ele) + 1);
} else {
res.set(ele, 1);
}
});
return res;
}