1004 Max Consecutive Ones III
https://leetcode.com/problems/max-consecutive-ones-iii/
solution
滑动窗口中的window里不超过k个0的最长子串
时间复杂度:O(n) 空间复杂度:O(1)
follow up
Previous3. Longest Substring Without Repeating CharactersNext1658 Minimum Operations to Reduce X to Zero
Last updated