public class Solution {
public int maxSubArray(int[] nums) {
int max = nums[0];
int[] sum = new int[nums.length];
sum[0] = nums[0];
for (int i = 1; i < nums.length; i++) {
sum[i] = Math.max(nums[i], sum[i - 1] + nums[i]);
max = Math.max(max, sum[i]);
}
return max;
}
}
Maximum Subarray
最新推荐文章于 2018-01-22 18:03:30 发布