Java算法之最大子序和

class Solution {
    public int maxSubArray(int[] nums) {
        int sum=0;
        int ret=Integer.MIN_VALUE;
        int len = nums.length;
        for(int i=0;iret){
                ret = sum;
            }
            if(sum<0){
                sum=0;
            }
        }
        return ret;
    }
}

53