Leetcode 918. Maximum Sum Circular Subarray (滑动窗口+单调队列好题)

  1. Maximum Sum Circular Subarray
    Medium

Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums.

A circular array means the end of the array connects to the beginning of the array. Formally, the next element of nums[i] is nums[(i + 1) % n] and the previous element of nums[i] is nums[(i - 1 + n) % n].

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

Example 1:

Input: nums = [1,-2,3,-2]

Output: 3

Explanation: Subarray [3] has maximum sum 3.

Example 2:

Input: nums = [5,-3,5]

Output: 10

Explanation: Subarray [5,5] has maximum sum 5 + 5 = 10.

Example 3:

Input: nums = [-3,-2,-3]

Output: -2

Explanation: Subarray [-2] has maximum sum -2.

Constraints:

n == nums.length

1 <= n <= 3 * 104

-3 * 104 <= nums[i] <= 3 * 104

解法1:

不用滑动窗口和单调队列。实际上我们找连续子数组最大和 与 sum - 连续子数组最小和 之间的最大值就可以了。

cpp 复制代码
class Solution {
public:
    int maxSubarraySumCircular(vector<int>& nums) {
        int sum = 0, currMaxSum = 0, currMinSum = 0;
        int gMaxSum = INT_MIN, gMinSum = INT_MAX;
        for (auto num : nums) {
            sum += num;
            currMaxSum = max(currMaxSum + num, num);
            gMaxSum = max(gMaxSum, currMaxSum);
            currMinSum = min(currMinSum + num, num);
            gMinSum = min(gMinSum, currMinSum);
        }
        //if all negative
        if (gMinSum == sum) return gMaxSum;
        return max(gMaxSum, sum - gMinSum);
    }
};

解法2:滑动窗口 + 单调队列

相关推荐
WBluuue1 小时前
数据结构与算法:摩尔投票算法
c++·算法·leetcode
2401_858286111 小时前
OS36.【Linux】简单理解EXT2文件系统(2)
linux·运维·服务器·数据结构·文件系统·ext2
小羊学伽瓦1 小时前
【Java数据结构】——常见力扣题综合
java·数据结构·leetcode·1024程序员节
文火冰糖的硅基工坊2 小时前
[人工智能-大模型-66]:模型层技术 - 两种编程范式:数学函数式编程与逻辑推理式编程,构建起截然不同的智能系统。
人工智能·神经网络·算法·1024程序员节
im_AMBER2 小时前
Leetcode 34
算法·leetcode
im_AMBER2 小时前
Leetcode 31
学习·算法·leetcode
吃着火锅x唱着歌3 小时前
LeetCode 74.搜索二维矩阵
算法·leetcode·矩阵
mit6.8243 小时前
hash|快速幂|栈
算法
OG one.Z3 小时前
06_决策树
算法·决策树·机器学习
爪哇部落算法小助手4 小时前
每日两题day23
算法