41. 最大子数组

[−2,2,−3,4,−1,2,1,−5,3]

[4,−1,2,1]

6

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 here
int sum = 0;
int max = nums[0];
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
if(sum > max){
max = sum;
}
if (sum < 0) {
sum = 0;
}
}
return max;
}
}