LeeCode 电话号码的字母组合

这个题目用到了reduce和map，还了解了下这种排列组合叫做笛卡尔卷积，以后这种组合的就可以多考虑用用reduce

var letterCombinations = function(digits) {
    
    if(digits === '') return [];
    let hash = {
        '2':['a','b','c'],
        '3':['d','e','f'],
        '4':['g','h','i'],
        '5':['j','k','l'],
        '6':['m','n','o'],
        '7':['p','q','r','s'],
        '8':['t','u','v'],
        '9':['w','x','y','z']
    }
    
    let map1 = [];
    let len = digits.length;
    for(let i=0;i<len;i++){
        map1.push(hash[digits[i]]);
    }
    

    let t = map1.reduce((a,b) => {
        
        let m = a.map(item => {
            return b.map(i => {
                return item.concat(i)
            })
        })
      

       let f = m.reduce((c, d)=> {
                            return c.concat(d)
                        }, [])
        return f;

    })
    return t;
   
    
};

其中数组flatten 看到了这样的实现，也重新复习了下reduce，原来基本没用过，脑袋里都是for循环。。。学习了

function flatten(arr) {
    return arr.reduce(function (prev, next) {
        return prev.concat(Array.isArray(next) ? flatten(next) : next)
    }, [])
}