comefrom: <awangdev>53. Maximum Subarray_7.java
code: private int findContinuousSum(int start, int left, int right, int offset, int[] nums) {
  
          int continuousSum = 0, max = 0;
          for (int i = start; i >= left && i <= right; i+=offset) {
              continuousSum += nums[i];
              max = Math.max(max, continuousSum);
          }
          return max;
      }
masked: private int sample_funcname ( int var_0 , int var_1 , int var_2 , int var_3 , int [ ] var_4 ) {
    int var_5 = 0 , max = 0 ;
    for ( int var_6 = var_0 ;
    var_6 >= var_1 && var_6 <= var_2 ;
    var_6 += var_3 ) {
      var_5 += var_4 [ var_6 ] ;
      max = Math . max ( max , var_5 ) ;
    }
    return max ;
  }
  