comefrom: <gouthampradhan>greedy_JumpGameII_1.java
code: public int jump(int[] nums) {
      int step = 0;
      int e = 0, max = 0;
      for (int i = 0; i < nums.length - 1; i++) {
        max = Math.max(max, i + nums[i]);
        if (i == e) {
          step++;
          e = max;
        }
      }
      return step;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    int var_2 = 0 ;
    int var_3 = 0 , max = 0 ;
    for ( int var_5 = 0 ;
    var_5 < var_0 . length - 1 ;
    var_5 ++ ) {
      max = Math . max ( max , var_5 + var_0 [ var_5 ] ) ;
      if ( var_5 == var_3 ) {
        var_2 ++ ;
        var_3 = max ;
      }
    }
    return var_2 ;
  }
  