comefrom: <awangdev>Maximum Average Subarray II_1.java
code: private boolean check(int[] nums, int k, double midAvg) {
  
          double preSum = 0;
          double sum = 0;
          double minPreSum = 0;
          for (int i = 0; i < k; i++) {
              sum += nums[i] - midAvg;
          }
          if (sum >= 0) {
              return true;
          }
          for (int i = k; i < nums.length; i++) {
              sum += nums[i] - midAvg;
              preSum += nums[i - k] - midAvg;
              minPreSum = Math.min(preSum, minPreSum);
              if (sum >= minPreSum) {
                  return true;
              }
          }
          return false;
      }
masked: private boolean var_0 ( int [ ] var_1 , int var_2 , double var_3 ) {
    double var_5 = 0 ;
    double var_6 = 0 ;
    double var_7 = 0 ;
    for ( int var_8 = 0 ;
    var_8 < var_2 ;
    var_8 ++ ) {
      var_6 += var_1 [ var_8 ] - var_3 ;
    }
    if ( var_6 >= 0 ) {
      return true ;
    }
    for ( int var_8 = var_2 ;
    var_8 < var_1 . length ;
    var_8 ++ ) {
      var_6 += var_1 [ var_8 ] - var_3 ;
      var_5 += var_1 [ var_8 - var_2 ] - var_3 ;
      var_7 = Math . min ( var_5 , var_7 ) ;
      if ( var_6 >= var_7 ) {
        return true ;
      }
    }
    return false ;
  }
  