climb stairs

题意：每次能走一步或者两步，求走完一段n步的楼梯有多少种走法。
思路：斐波那契数列
代码：
package ClimbStairs;

public class ClimbStairs {
public int Climb(int n){
if(n==0 || n==1 || n==2) return n;
int []arr = new int[n+1];
arr[0] = 0 ;
arr[1] = 1;
arr[2] = 2;
for(int i = 3 ; i <= n ; i++){
arr[i] = arr[i-1] + arr[i-2];
}
return arr[n];
}
public static void main(String[] args) {
ClimbStairs cs = new ClimbStairs();
System.out.println(cs.Climb(5));
}
}