JS:检查javascript中两个数组的区别

Question

输出为真或假的两个不同的数组。用函数this my code比较两个数组:

    var cekDiff = function (arr1, arr2) {
    var maxLength = 0,
        cekTrue = 0;
    if (arr1.length > arr2.length) maxLength = arr1.length;
    else maxLength = arr2.length;
    for (var i = 0; i < maxLength; i++) {
        if (arr1[i] == arr2[i]) {
            cekTrue++;
        }
    }
    if (cekTrue >= maxLength) return true;
    else return false;
}


if (cekDiff([0, 1, 2, 4, 3], [0, 1, 2, 3, 4])) {
    console.log("match");
} else {
    console.log("different");
}

Answer 1

您可以通过递增或递减来计算每个元素。然后获取值，如果全部为零，则返回 true。

function sameValues(a, b) {
    const
        counter = (o, i) => k => o[k] = (o[k] || 0) + i,
        count = {};
    
    a.forEach(counter(count, 1));
    b.forEach(counter(count, -1));
    
    return !Object.values(count).some(Boolean);
}


console.log(sameValues([0, 1, 2, 4, 3], [0, 1, 2, 3, 4]));
console.log(sameValues([0, 1, 2, 4, 3], [0, 1, 2, 3, 4, 5]));

Answer 2

使用reduce检查您的阵列

const isArrayExact = (arr1, arr2) => arr1.reduce((acc, curr, index) => acc && ,true)

比较每个元素，但检查是否存在

Answer 3

您非常接近，因为两个数组的值顺序不同，并且您是按索引匹配的（newArr1[i]==newArr2[i]），所以您需要先对数组排序，然后检查是否相等

js prettyprint-override">var cekDiff = function(arr1, arr2) {
  let newArr1 = [...arr1].sort((a, b) => a - b)
  let newArr2 = [...arr2].sort((a, b) => a - b)
  var maxLength = 0,
    cekTrue = 0;
  if (newArr1.length > newArr2.length) maxLength = arr1.length;
  else maxLength = newArr2.length;
  for (var i = 0; i < maxLength; i++) {
    if (newArr1[i] == newArr2[i]) {
      cekTrue++;
    }
  }
  if (cekTrue >= maxLength) return true;
  else return false;
}


if (cekDiff([0, 1, 2, 4, 3], [0, 1, 2, 3, 4])) {
  console.log("match");
} else {
  console.log("different");
}