comefrom: <awangdev>509. Fibonacci Number_2.java
code: public int fibonacci(int n) {
          if (n <= 1) {
              return 0;
          }
          int[] fib = new int[n];
          fib[0] = 0;
          fib[1] = 1;
          for (int i = 2; i < n; i++) {
              fib[i] = fib[i - 1] + fib[i - 2];
          }
          return fib[n - 1];
      }
masked: public int sample_funcname ( int var_0 ) {
    if ( var_0 <= 1 ) {
      return 0 ;
    }
    int [ ] var_1 = new int [ var_0 ] ;
    var_1 [ 0 ] = 0 ;
    var_1 [ 1 ] = 1 ;
    for ( int var_2 = 2 ;
    var_2 < var_0 ;
    var_2 ++ ) {
      var_1 [ var_2 ] = var_1 [ var_2 - 1 ] + var_1 [ var_2 - 2 ] ;
    }
    return var_1 [ var_0 - 1 ] ;
  }
  