<awangdev>70. Climbing Stairs_1.java
public int climbStairs(int n) {
        if (n <= 1) {
            return 1;
        }
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        
        return dp[n];
    }
public int sample_funcname ( int var_0 ) {
  if ( var_0 <= 1 ) {
    return 1 ;
  }
  int [ ] var_2 = new int [ var_0 + 1 ] ;
  var_2 [ 0 ] = 1 ;
  var_2 [ 1 ] = 1 ;
  for ( int var_5 = 2 ;
  var_5 <= var_0 ;
  var_5 ++ ) {
    var_2 [ var_5 ] = var_2 [ var_5 - 1 ] + var_2 [ var_5 - 2 ] ;
  }
  return var_2 [ var_0 ] ;
}
