reduce() 方法對(duì)數(shù)組中的每個(gè)元素執(zhí)行一個(gè)由您提供的reducer函數(shù)(升序執(zhí)行)巨税，將其結(jié)果匯總為單個(gè)返回值。

reducer 函數(shù)接收f(shuō)our個(gè)參數(shù):

1. Accumulator (acc) (累計(jì)器)
2. Current Value (cur) (當(dāng)前值)
3. Current Index (idx) (當(dāng)前索引)
4. Source Array (src) (源數(shù)組)

arr.reduce(callback(accumulator, currentValue[, index[, array]])[, initialValue])

數(shù)組累加等

const res1 = [0, 1, 2, 3, 4].reduce((prev, curr) => prev + curr ) 
const res2 = [0, 1, 2, 3, 4].reduce((prev, curr, currentIndex, array) => {
    return prev+ curr
}, 0)
console.log(res1 === res2 , res1, res2) // true 10 10

數(shù)組去重

const arr = [1, 1, 2, 2, 6 , 5 ,66]
const newArr= arr.reduce((pre, cur) => {
      if(!pre.includes(cur)){
           return pre.concat(cur)
       }else{
           return pre
       }
}, [])
console.log(newArr) // [1, 2, 6, 5, 66]
console.log(newArr.sort()) //  [1, 2, 5, 6, 66]

數(shù)組計(jì)數(shù)

const arr = ['星期一', '星期二', '星期三', '星期四', '星期四',  '星期五', '星期二', '星期一']
const newObj= arr.reduce((pre, cur ) => {
      if(cur in pre){
           pre[cur] ++
       }else{
           pre[cur] = 1
       }
    return pre
}, {}) //初始傳入空對(duì)象

console.log(newObj) // {星期一: 2, 星期二: 2, 星期三: 1, 星期四: 2, 星期五: 1}

數(shù)組扁平化

const arr = [1, [2,3],[4,[7,8]]]

no.flat

console.log(arr.flat(Infinity)) //[1, 2, 3, 4, 7, 8]

no.正則

 const res2 =  JSON.stringify(arr).replace(/\[|\]/g, '')
console.log(res2.split(',')) //["1", "2", "3", "4", "7", "8"]

const res3 = JSON.parse('[' + res2 + ']')
console.log(res3) // [1, 2, 3, 4, 7, 8]

no.for

 const array = []
 const fn = (arr) =>{
   for (let i = 0; i < arr.length; i++) {
       if(Array.isArray(arr[i])){
            fn(arr[i])
       }else{
           array.push(arr[i])
       }
    }
}
fn(arr)
console.log(array) //[1, 2, 3, 4, 7, 8]

no.reduce

const newArr = (arr) =>{
   return arr.reduce((pre, cur)=>{
       return pre.concat(Array.isArray(cur) ? newArr(cur) : cur)
   }, [])
}
console.log(newArr(arr)) //[1, 2, 3, 4, 7, 8]

手寫(xiě)一個(gè)reduce

//放在數(shù)組原型下
Array.prototype.reduceArr =  function(fn, initValue){
    //判斷是否為function
    if(Object.prototype.toString.call(fn) !== '[object Function]'){
        throw new Error('不是一個(gè)function')
    }
   
    let arr = this;//當(dāng)前數(shù)組
    let initIndex;//初始下標(biāo)
    let acc;//累加器
    //判斷是否有第二個(gè)初始參數(shù)
    initIdnex = arguments.length === 0 ?  1 : 0;
    acc = arguments.length === 0 ? arr[0] : initValue;
    //遍歷回調(diào)并返回出去
    for (let i = initIdnex; i < arr.length; i++) {
        acc = fn(acc,arr[i],i,arr)
    }
    return acc;
}
//實(shí)驗(yàn)
let arr = [1,2,3]
let arrRes1 = arr.reduceArr((pre, cur) => {
     return pre + cur   
}, 0)

console.log(arrRes1) // 6
let arrRes2 = arr.reduceArr((pre, cur) => {
     return pre + cur   
}, 1)

console.log(arrRes2) // 7
let arrRes3 = arr.reduceArr((pre, cur) => {
     return pre + cur   
}, 10)
console.log(arrRes3) // 16

更多

MDN reduce