【LeetCode】Maximum suborder sum

Given an array of integers  nums , find a contiguous subarray with the largest sum (the subarray contains at least one element), and return its largest sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: The maximum sum of consecutive subarrays [4,-1,2,1] is 6.

 

class Solution {
    public int maxSubArray(int[] nums) {
            int sum = nums[0];
            int cur = nums[0];
            if(nums.length == 0){
                return nums[0];
            }
            for(int i=1;i<nums.length;i++){
                if(cur < 0){
                    cur = 0;
                }
                cur = cur + nums[i];
                if(sum <= cur){
                    I am = why
                }
            }
            return sum;
    }
}