简化检查数组匹配的函数

function arraysMatch(arr1, arr2) {
    if (arr1.length !== arr2.length) {
        return false;
    }
    for (let i = 0; i < arr1.length; i++) {
        if (arr1[i] !== arr2[i]) {
            return false;
        }
    }
    return true;
}

// 示例用法
console.log(arraysMatch([1, 2, 3], [1, 2, 3])); // true
console.log(arraysMatch([1, 2, 3], [3, 2, 1])); // false

function arraysMatchIgnoreOrder(arr1, arr2) {
    if (arr1.length !== arr2.length) {
        return false;
    }
    const set1 = new Set(arr1);
    const set2 = new Set(arr2);
    for (let item of set1) {
        if (!set2.has(item)) {
            return false;
        }
    }
    return true;
}

// 示例用法
console.log(arraysMatchIgnoreOrder([1, 2, 3], [3, 2, 1])); // true

function deepEqual(obj1, obj2) {
    if (obj1 === obj2) return true;
    if (typeof obj1 !== 'object' || obj1 === null || typeof obj2 !== 'object' || obj2 === null) return false;
    let keys1 = Object.keys(obj1), keys2 = Object.keys(obj2);
    if (keys1.length !== keys2.length) return false;
    for (let key of keys1) {
        if (!keys2.includes(key) || !deepEqual(obj1[key], obj2[key])) return false;
    }
    return true;
}

function arraysDeepMatch(arr1, arr2) {
    if (arr1.length !== arr2.length) {
        return false;
    }
    for (let i = 0; i < arr1.length; i++) {
        if (!deepEqual(arr1[i], arr2[i])) {
            return false;
        }
    }
    return true;
}

// 示例用法
console.log(arraysDeepMatch([{a: 1}, {b: 2}], [{a: 1}, {b: 2}])); // true