Maximum Sum Circular Subarray
描述
TODO
分析
TODO
代码
- Python
- Java
- C++
// TODO
// Maximum Sum Circular Subarray
// 时间复杂度O(n)，空间复杂度O(1)
// see https://leetcode.com/problems/maximum-sum-circular-subarray/discuss/178422/One-Pass
class Solution {
public:
int maxSubarraySumCircular(vector<int>& nums) {
int total = 0, globalMax = nums[0], localMax = 0, globalMin = nums[0], localMin = 0;
for (int& num : nums) {
localMax = max(localMax + num, num);
globalMax = max(globalMax, localMax);
localMin = min(localMin + num, num);
globalMin = min(globalMin, localMin);
total += num;
}
return globalMax > 0 ? max(globalMax, total - globalMin) : globalMax;
}
};
# No code was provided to translate. Please provide the Java code you'd like to be translated to Python 3.
def todo():
pass