原题链接

LeetCode;

function climbStairs(n: number): number {

   let first = 0;
   let second = 0;
   let answer = 1;
   for(let i = 1; i <= n; i++) {
       first = second;
       second = answer;
       answer = first + second;
   }

   return answer;
};