package com.fishercoder.solutions;

/**
 * 70. Climbing Stairs

 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?

 Note: Given n will be a positive integer.

 Example 1:

 Input: 2
 Output:  2
 Explanation:  There are two ways to climb to the top.

 1. 1 step + 1 step
 2. 2 steps

 Example 2:

 Input: 3
 Output:  3
 Explanation:  There are three ways to climb to the top.

 1. 1 step + 1 step + 1 step
 2. 1 step + 2 steps
 3. 2 steps + 1 step

 */

public class _70 {
  public static class Solution1 {
    //classical dp problem
    public int climbStairs(int n) {
      if (n < 1) {
        return 0;
      } else if (n < 4) {
        return n;
      } else {
        int[] dp = new int[n + 1];
        //the number of ways to reach step n could be calculated from n-1 and n-2
        dp[1] = 1;
        dp[2] = 2;
        for (int i = 3; i <= n; i++) {
          dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
      }
    }
  }
}

@@ -622,35 +622,8 @@
 1 %7B%0A
-    //classical dp problem%0A
     
@@ -666,17 +666,18 @@
   if (n 
-%3C
+==
  1) %7B%0A  
@@ -693,189 +693,52 @@
 urn 
-0;%0A      %7D else if (n %3C 4) %7B%0A        return n;%0A      %7D else %7B%0A        int%5B%5D dp = new int%5Bn + 1%5D;%0A        //the number of ways to reach step n could be calculated from n-1 and n-2%0A  
+n;%0A      %7D%0A      int%5B%5D dp = new int%5Bn + 1%5D;%0A
     
@@ -756,18 +756,16 @@
 ;%0A      
- 
- 
 dp%5B2%5D = 
@@ -767,18 +767,16 @@
 2%5D = 2;%0A
-  
       fo
@@ -812,18 +812,16 @@
         
-  
 dp%5Bi%5D = 
@@ -845,30 +845,26 @@
 - 2%5D;%0A      
- 
- 
 %7D%0A
-  
       return
@@ -871,24 +871,16 @@
  dp%5Bn%5D;%0A
-      %7D%0A
     %7D%0A  

refactor 70