Time Cost

3min12s

Implementation

None

Code

• My Solution

  class Solution {
  public:
    int climbStairs(int n) {
        vector<long long> ways(n+1, 0);
        ways[0] = 1;
        ways[1] = 1;
  
        for (int i=2; i<=n; i++) {
            ways[i] = ways[i-1] + ways[i-2];
        }
  
        return ways[n];
    }
  };