<awangdev>53. Maximum Subarray_10.java
public int maxSubArray(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        int preSum = 0, minPreSum = 0;
        int max = Integer.MIN_VALUE;
        for (int num : nums) {
            preSum += num;
            max = Math.max(max, preSum - minPreSum);
            minPreSum = Math.min(minPreSum, preSum);
        }
        return max;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) return 0 ;
  int var_4 = 0 , var_5 = 0 ;
  int max = Integer . MIN_VALUE ;
  for ( int var_9 : var_0 ) {
    var_4 += var_9 ;
    max = Math . max ( max , var_4 - var_5 ) ;
    var_5 = Math . min ( var_5 , var_4 ) ;
  }
  return max ;
}
