package Maxmoney;
public class Lchar{

public int climbStair(int t) {
if(t == 0){
return 1;
}

int[] ST= new int[t+1];
ST[0] = 1;
ST[1] = 1;

for(int j=2;j<=t;j++){
ST[j] = ST[j-2] + ST[j-1];
}

return ST[t];
}
}

爬楼梯