comefrom: <gouthampradhan>dynamic_programming_ClimbingStairs_1.java
code: public int climbStairs(int n) {
      if (n == 0 || n == 1) return 1;
      int[] A = new int[n + 1];
      A[n] = 1;
      A[n - 1] = 1;
      for (int i = n - 2; i >= 0; i--) A[i] = A[i + 1] + A[i + 2];
      return A[0];
    }
masked: public int sample_funcname ( int var_0 ) {
    if ( var_0 == 0 || var_0 == 1 ) return 1 ;
    int [ ] var_3 = new int [ var_0 + 1 ] ;
    var_3 [ var_0 ] = 1 ;
    var_3 [ var_0 - 1 ] = 1 ;
    for ( int var_5 = var_0 - 2 ;
    var_5 >= 0 ;
    var_5 -- ) var_3 [ var_5 ] = var_3 [ var_5 + 1 ] + var_3 [ var_5 + 2 ] ;
    return var_3 [ 0 ] ;
  }
  