You are climbing a staircase. It takes n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
class Solution {
public int climbStairs(int n) {
int dp[]=new int[n+1];
dp[0]=1;
for(int i=0;i<=n;i++){
if(i=1){
dp[i]=dp[i-1]+0;
}
else{
dp[i]=dp[i-1]+dp[i-2];
}
}
return dp[n];
}
}
if(i=1)— you probably meanif (i==1). Though your code still wouldn't make sense.