JavaScript中比较好用且实用的代码集合【数组篇】

数组篇

1、数组打乱（洗牌函数）

const shuffleArray = arr => arr.sort(() => Math.random() - 0.5)
shuffleArray([1,2,3,4,5,6,7,8,9,10,11,12])

2、生成数组

//  方案一
//  n为需要生成的范围
const createArray = (n) => new Array(n).fill(0).map((v, i) => i)
//  方案二
const createArray = (n) => Array.from(new Array(n), (v, i) => i)
createArray(100) // 0 - 99数组

3、数组去重

//  方案一
const removeDuplicates = (arr) => Array.from(new Set(arr.flat(Infinity)))
//  方案二
const removeDuplicates = (arr) => [...new Set(arr)]
removeDuplicates([1, 4, 3, 4, 5])

4、最大值索引

const indexOfMax = (arr) => arr.reduce((prev, curr, i, a) => (curr > a[prev] ? i : prev), 0);
indexOfMax([1, 3, 9, 7, 5, 10])

5、最小值索引

const indexOfMin = (arr) => arr.reduce((prev, curr, i, a) => (curr < a[prev] ? i : prev), 0)
indexOfMin([2, 5, 3, 4, 1, 0, 9, 11])

6、多数组交集

const intersection = (a, ...arr) => [...new Set(a)].filter((v) => arr.every((b) => b.includes(v)))
intersection([1, 2, 3, 4], [2, 3, 4, 7, 8], [1, 3, 4, 9])

7、最接近的数值

const closest = (arr, n) => arr.reduce((prev, curr) => (Math.abs(curr - n) < Math.abs(prev - n) ? curr : prev))
closest([29, 87, 8, 78, 97, 20, 75, 33, 24, 17], 50)

8、矩阵交换

const transpose = (matrix) => matrix[0].map((col, i) => matrix.map((row) => row[i]));
transpose(
    [              // [
        [1, 2, 3], //      [1, 4, 7],
        [4, 5, 6], //      [2, 5, 8],
        [7, 8, 9], //      [3, 6, 9],
     ]             //  ]
 );