website/content/sliding_window.md
+++ author = "一缕殇流化隐半边冰霜" categories = ["Algorithm", "Sliding Window"] date = 2019-12-14T11:46:00Z description = "" draft = false image = "https://img.halfrost.com/Blog/ArticleTitleImage/143_0.png" slug = "sliding_window" tags = ["Algorithm", "Sliding Window"] title = "Algorithm in LeetCode —— Sliding Window"
+++
left, right := 0, -1
for left < len(s) {
if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
freq[s[right+1]-'a']++
right++
} else {
freq[s[left]-'a']--
left++
}
result = max(result, right-left+1)
}
| Title | Solution | Difficulty | Time | Space | 收藏 |
|---|---|---|---|---|---|
| 3. Longest Substring Without Repeating Characters | Go | Medium | O(n) | O(1) | ❤️ |
| 76. Minimum Window Substring | Go | Hard | O(n) | O(n) | ❤️ |
| 239. Sliding Window Maximum | Go | Hard | O(n * k) | O(n) | ❤️ |
| 424. Longest Repeating Character Replacement | Go | Medium | O(n) | O(1) | |
| 480. Sliding Window Median | Go | Hard | O(n * log k) | O(k) | ❤️ |
| 567. Permutation in String | Go | Medium | O(n) | O(1) | ❤️ |
| 978. Longest Turbulent Subarray | Go | Medium | O(n) | O(1) | ❤️ |
| 992. Subarrays with K Different Integers | Go | Hard | O(n) | O(n) | ❤️ |
| 995. Minimum Number of K Consecutive Bit Flips | Go | Hard | O(n) | O(1) | ❤️ |
| 1004. Max Consecutive Ones III | Go | Medium | O(n) | O(1) | |
| 1040. Moving Stones Until Consecutive II | Go | Medium | O(n log n) | O(1) | ❤️ |
| 1052. Grumpy Bookstore Owner | Go | Medium | O(n log n) | O(1) | |
| 1074. Number of Submatrices That Sum to Target | Go | Hard | O(n^3) | O(n) | ❤️ |