LeetCode-70

LeetCode-70

You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a positive integer.
Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.

1. 1 step + 1 step
2. 2 steps
   Example 2:
   Input: 3
   Output: 3
   Explanation: There are three ways to climb to the top.
3. 1 step + 1 step + 1 step
4. 1 step + 2 steps
5. 2 steps + 1 step

Python

class Solution(object):
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        prev,current=0,1
        for i in range(n):
            prev,current=current,prev+current
        return current

C++

class Solution {
public:
    int climbStairs(int n) {
        int f1,f2,f3;
        f1=1;
        f2=2;
        if (n==1)
            return f1;    
        if (n==2)
            return f2;
            
        while((n-2)>0)
        {
            f3=f1+f2;
            f1=f2;
            f2=f3;
            n--;
        }
        return f3;
    }
};