检查一个数组是否包含在另一个数组中

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

const arr1 = [1, 2, 3, 4, 5];
const arr2 = [3, 4, 5];
console.log(isArrayContained(arr1, arr2)); // 输出：true

function isArrayContained(arr1, arr2) {
  return arr2.every(element => arr1.includes(element));
}

const arr1 = [1, 2, 3, 4, 5];
const arr2 = [3, 4, 5];
console.log(isArrayContained(arr1, arr2)); // 输出：true

function isArrayContained(arr1, arr2) {
  const set1 = new Set(arr1);
  const set2 = new Set(arr2);
  return isSuperset(set1, set2);
}

function isSuperset(set1, set2) {
  for (let element of set2) {
    if (!set1.has(element)) {
      return false;
    }
  }
  return true;
}

const arr1 = [1, 2, 3, 4, 5];
const arr2 = [3, 4, 5];
console.log(isArrayContained(arr1, arr2)); // 输出：true