public class Solution {
/**
* @param nums: A list of integers
* @return: A integer indicate the sum of max subarray
*/
public int maxSubArray(ArrayList<Integer> nums) {
// 2015-09-09 O(n)
if (nums == null || nums.size() == 0) {
// 异常
}
int sum = 0;
int minSum = 0;
int rst = Integer.MIN_VALUE;
for (int i = 0; i < nums.size(); i++) {
sum += nums.get(i);
rst = Math.max(rst, sum - minSum);
minSum = Math.min(minSum, sum);
}
return rst;
}
}
[刷题]Maximum Subarray
最新推荐文章于 2015-10-14 09:46:30 发布