LeetCode-Climbing Stairs

Problem:
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?
Subscribe to see which companies asked this question
Analysis:
方法1利用递归，可是总是报错， Time Limit Exceeded，Last executed input: 44，希望明白的朋友说一下。
方法2 利用的是很简单的变量传递思想，主要是把握住Sn = Sn-1 + Sn-2，并做好边问题。
Anwser1:

java代码

public class Solution {  
    public int climbStairs(int n) {  
        if (n == 0 || n == 1) return 1;  
        if (n < 0) return 0;  
        return climbStairs(n - 1) + climbStairs(n - 2);        
    }  
} 

Anwser2:

java代码

public class Solution {
    public int climbStairs(int n) {
        if(n<=2) return n;
        else{
            int temp1,temp2,temp3;
            temp1 = 1;
            temp2 = 2;
            temp3 = 0;
            for(int i=3;i<=n;i++){
                temp3 = temp1 + temp2;
                temp1 = temp2;
                temp2 = temp3;
            }
            return temp3;
        }
    }
}