weixin_58286631的博客

Pretty straightforward! We use sliding window and when the 0 appears in that window more than once, we would break the window, otherwise we would keep update the answer. class Solution { public: int longestSubarray(vector<int>& nums) {

This is an implicit sliding window problem. It is almost the same as buying and selling the stock 3. The idea is that we gonna set up a middle line, and the line would keep moving forward. When is it moving, we would see if there is any better option for

We know the subarray is a consecutive part of an array and this leads us to think about the two-pointer and sliding windows sort of algorithms. As the question asks to find the maximum sum of the subarray. We consider using sliding windows which is a powe