【LeetCode】070.Climbing Staris

题目：

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?

解答：基础级的递归题，公式为f(n) = f(n-1)+f(n-2),f(0)=1,f(1)=1；本来用递归和非递归的方式都可以实现，提交时递归实现超时。

代码1（递归--超时）：

int climbStairs(int n){
    if(n < 3) return n;
    return climbStairs(n-1)+climbStairs(n-2);
}

代码2（迭代，AC）：

public class Solution {
    public int climbStairs(int n) {
		int step1 = 1;
		int step2 = 1;
		for(int i=2;i<=n;i++){
			int nextStep = step1 + step2;
			step1 = step2;
			step2 = nextStep;
		}
		return step2;
	}
}