Java实现-最大子数组1

public class Solution {    /**     * @param nums: A list of integers     * @return: A integer indicate the sum of max subarray     */    public int maxSubArray(int[] nums) {        // write your code        if(nums.length==0){return 0;}int max=Integer.MIN_VALUE;int cur=0;for(int i=0;i<nums.length;i++){cur+=nums[i];max=Math.max(max, cur);cur=cur<0?0:cur;}return max;    }}