递归

recursive.js

// 1*2*3*...100
function recrusive(num){
  if(num === 1){
    return num;
  }else{
    return num*recrusive(num-1)
  }
}

// 菜单递归 后端返回递归结构，前端更换键名 例如 url -> path
function menuRecursive(data) {
  return data.map(item => {
    const { url, children, ...rest } = item;
    const result = {
      path: url,
      ...rest
    }
    if (children) {
      result.children = menuRecursive(children)
    }
    return result
  })
}

const menu = [
  {
    url: 1,
    children:
      [
        {
          url: 11, children: [
            { url: 111 }
          ]
        },
        {
          url: 22, children: [
            { url: 222 }
          ]
        }
      ]
  },
  {
    url: 2,
    children: []
  }
];

console.log(recrusive(3))  // 6
console.log(menuRecursive(menu))