<awangdev>509. Fibonacci Number_2.java
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];
    }
public int sample_funcname ( int var_0 ) {
  if ( var_0 <= 1 ) {
    return 0 ;
  }
  int [ ] var_3 = new int [ var_0 ] ;
  var_3 [ 0 ] = 0 ;
  var_3 [ 1 ] = 1 ;
  for ( int var_5 = 2 ;
  var_5 < var_0 ;
  var_5 ++ ) {
    var_3 [ var_5 ] = var_3 [ var_5 - 1 ] + var_3 [ var_5 - 2 ] ;
  }
  return var_3 [ var_0 - 1 ] ;
}
