本文深入探讨了滑动窗口算法的应用，特别是在解决LeetCode题目“滑动窗口的最大值”及“最大子数组和”中。通过实例[-2,1,-3,4,-1,2,1,-5,4]，详细解析了如何找到连续子数组的最大和，其最大和为6，即[4,-1,2,1]。此外，文章还提到了O(n)解决方案，并鼓励读者尝试使用更复杂的分治策略。
从上面能看到，Sliding Window一共7题，对应力扣，分别是：
-
滑动窗口的最大值
-
Maximum Subarray （Easy）
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
扫一扫
665
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
