comefrom: <awangdev>53. Maximum Subarray_8.java
code: public int maxSubArray(int[] nums) {
          if (nums == null || nums.length == 0) {
              return 0;
          }
          final int[] sums = new int[nums.length];
          sums[0] = nums[0];
          int maxSum = sums[0];
          
          for (int i = 1; i < nums.length; i++) {
              if (sums[i - 1] < 0) {
                  sums[i] = nums[i];
              } else {
                  sums[i] = sums[i - 1] + nums[i];
              }
              maxSum = Math.max(maxSum, sums[i]);
          }
          return maxSum;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    final int [ ] var_4 = new int [ var_0 . length ] ;
    var_4 [ 0 ] = var_0 [ 0 ] ;
    int var_5 = var_4 [ 0 ] ;
    for ( int var_7 = 1 ;
    var_7 < var_0 . length ;
    var_7 ++ ) {
      if ( var_4 [ var_7 - 1 ] < 0 ) {
        var_4 [ var_7 ] = var_0 [ var_7 ] ;
      }
      else {
        var_4 [ var_7 ] = var_4 [ var_7 - 1 ] + var_0 [ var_7 ] ;
      }
      var_5 = Math . max ( var_5 , var_4 [ var_7 ] ) ;
    }
    return var_5 ;
  }
  