题目
代码部分一(22ms)
class Solution {
public int maxSubarraySumCircular(int[] A) {
int[] max = new int[A.length];
Arrays.fill(max, Integer.MIN_VALUE); //定义max[] 用与存储当前位置 i 的左边子数组的最大和
int sum = 0;
int hsum = 0;
int curmax = Integer.MIN_VALUE;
for(int i = 0; i < A.length; i++){ //遍历A[], 存储 i 左边子数组最大和
sum += A[i];
if(i == 0) max[i] = sum;
else max[i] = Math.max(sum, max[i - 1]);
hsum += A[i]; //记录最大的区段子数组的和
curmax = Math.max(curmax, hsum);
if(hsum < 0) hsum = 0;
}
sum = 0;
for(int i = A.length - 1; i > 0; i--){ //自 n 到 1 遍历 A[]
sum += A[i]; //记录 i 的右边子数组和
curmax = Math.max(curmax, sum + max[i - 1]); //当前右边的和与左边子数组的最大值相加(环)
}
return curmax;
}
}
代码部分二(27ms)
class Solution {
public int maxSubarraySumCircular(int[] A) {
int res = A[0];
for(int i : A){
res = Math.max(res, i);
}
if(res <= 0) return res;
int sum = 0;
for(int i = 0; i < A.length; i++){
sum = Math.max(0, sum + A[i]);
res = Math.max(sum, res);
}
int minimum = 0;
sum = 0;
for(int i = 0; i < A.length; i++){
sum = Math.min(0, sum + A[i]);
minimum = Math.min(minimum, sum);
}
int temp = 0;
for(int i : A) temp += i;
res = Math.max(res, temp - minimum);
return res;
}
}