functionsum(num){if(num===1)return1return num +sum(num-1)}
递归求n的阶乘
functionfactorial(num){if(num===1)return1return num *factorial(num-1)}
递归斐波那契数列
functionfibonacci(num){if(num ===1|| num ===2)return1returnfibonacci(num -1)+fibonacci(num -2)}
递归数组扁平化
functioncusFlat(array){const res =[]functionflatCus(params){
params.forEach(item=>{if(Array.isArray(item)){flatCus(item)}else{
res.push(item)}})}flatCus(array)return res
}