-12

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];
    }
    }
Improve this question
3
  • 3
    Please always explain what errors you get. We cannot guess and the errors usually explain what is wrong. Commented Nov 21 at 13:19
  • 2
    When you say "error" do you mean your result is incorrect, or do you mean a compile or runtime error (not related to the expected result)? Your code appears to calculate the Fibonacci sequence. How is that related to the stated problem? Commented Nov 21 at 13:21
  • 5
    if(i=1) — you probably mean if (i==1). Though your code still wouldn't make sense. Commented Nov 21 at 13:35
Related questions
4348
What are the differences between a HashMap and a Hashtable in Java?
3734
What is the difference between public, protected, package-private and private in Java?
1906
Why does this code using random strings print "hello world"?
Load 7 more related questions Show fewer related questions

0

Reset to default

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.