爬楼梯-typescript

• 爬楼梯

  思路：n = (n-1) + (n-2)

  function climbStairs(n: number): number {
    if(n<=2){
        return n
    }
    let i = 1;
    let j = 2
    for(let k= 3;k<=n; k++){
      const n1 = i+j
      i= j
      j= n1
  
    }
  
    return j
    };