[Leetcode] Climbing Stairs (Java)

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?

爬楼梯，每次能爬1步或2步，问爬n阶楼梯有多少种爬法

public class Solution {
    public int climbStairs(int n) {
    	if(n==1)
			return 1;
		if(n==2)
			return 2;
		int[] res = new int[n+1];
		res[1]=1;
		res[2]=2;
		for(int i=3;i<n+1;i++){
			res[i]=res[i-1]+res[i-2];
		}
		return res[n];
    }
}