常见的js面试题之递归算法

递归深拷贝

function deepClone(obj){
    let newObj = {}
    for (const key in obj) {
        if (typeof key === 'Object') {
            newObj[key] = deepClone(key)
        } else {
            newObj[key] = obj[key]
        }
    }
    return newObj
}

递归求累加和

function sum(num){
    if (num===1) return 1 
    return num + sum(num-1)
}

递归求n的阶乘

function factorial(num) {
    if(num===1) return 1
    return num * factorial(num-1)
}

递归斐波那契数列

function fibonacci(num) {
    if(num === 1 || num === 2) return 1
    return fibonacci(num - 1) + fibonacci(num - 2)
}

递归数组扁平化

function cusFlat(array) {
    const res = []
    function flatCus(params) {
        params.forEach(item => {
          if(Array.isArray(item)){
              flatCus(item)
          }else{
            res.push(item)
          }
        })
    }
    flatCus(array)
    return res
}