918. Maximum Sum Circular Subarray

Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.

Here, a circular array means the end of the array connects to the beginning of the array. (Formally, C[i] = A[i] when 0 <= i < A.length, and C[i+A.length] = C[i] when i >= 0.)

Also, a subarray may only include each element of the fixed buffer A at most once. (Formally, for a subarray C[i], C[i+1], …, C[j], there does not exist i <= k1, k2 <= j with k1 % A.length = k2 % A.length.)

Example 1:

Input: [1,-2,3,-2]
Output: 3
Explanation: Subarray [3] has maximum sum 3
Example 2:

Input: [5,-3,5]
Output: 10
Explanation: Subarray [5,5] has maximum sum 5 + 5 = 10
Example 3:

Input: [3,-1,2,-1]
Output: 4
Explanation: Subarray [2,-1,3] has maximum sum 2 + (-1) + 3 = 4
Example 4:

Input: [3,-2,2,-3]
Output: 3
Explanation: Subarray [3] and [3,-2,2] both have maximum sum 3
Example 5:

Input: [-2,-3,-1]
Output: -1
Explanation: Subarray [-1] has maximum sum -1

Note:

1. -30000 <= A[i] <= 30000
2. 1 <= A.length <= 30000

方法1: dynamic programming (Kadane’s Algorithm)

官方题解：https://leetcode.com/problems/maximum-sum-circular-subarray/solution/
discussion: https://leetcode.com/problems/maximum-sum-circular-subarray/discuss/178517/C%2B%2B-single-pass-O(N)-linear-time-O(1)-constant-space

思路：

class Solution {
public:
    int maxSubarraySumCircular(vector<int>& A) {
        int sum_mn = 0, sum_mx = 0, total = 0, res_mn = INT_MAX, res_mx = INT_MIN;
        for (int num: A) {
            total += num;
            sum_mx = max(num, sum_mx + num);
            sum_mn = min(num, sum_mn + num);
            res_mx = max(res_mx, sum_mx);
            res_mn = min(res_mn, sum_mn);
        }
        return res_mx < 0 ? res_mx : max(res_mx, total - res_mn);
    }
};

方法2: monoqueue

思路：

class Solution {
public:
    int maxSubarraySumCircular(vector<int>& A) {
        int n = A.size(), res = INT_MIN;
        vector<int> presum(n * 2 + 1, 0);
        for (int i = 1; i < 2 * n + 1; i++) presum[i] = presum[i - 1] + ((i <= n) ? A[i - 1] : A[i - n - 1]);
        deque<int> mq;
        mq.push_back(0);
        for (int i = 1; i <= 2 * n; i++) {
            while (!mq.empty() && i - mq.front() > n) mq.pop_front();
            res = max(res, presum[i] - presum[mq.front()]);
            while (!mq.empty() && presum[mq.back()] >= presum[i]) mq.pop_back();
            mq.push_back(i);
        }
        return res;
    }
};