567. Permutation in String
567. Permutation in String
1. 我們需要想的是窗口增大的時候，需要更新哪些資訊？
2. 如果 char
Gary Lai
159. Longest Substring with At Most Two Distinct Characters
159. Longest Substring with At Most Two Distinct Characters
class
1234. Replace the Substring for Balanced String
1234. Replace the Substring for Balanced String
1358. Number of Substrings Containing All Three Characters
1358. Number of Substrings Containing All Three Characters
977. Squares of a Sorted Array
997. Squares of a Sorted Array
這一個題目的問題是給定一個排序好的陣列，計算出所有數字的次方後，再依序由小排到大。
給定的排序好的陣列看似很貼心，
448. Find All Numbers Disappeared in an Array
448. Find All Numbers Disappeared in an Array
這個題目的簡單做法是排序後再找，但是這樣的做法通常都是會被問到提供更好的解法。
1170. Compare Strings by Frequency of the Smallest Character
1170. Compare Strings by Frequency of the Smallest Character
class
220. Contains Duplicate III
220. Contains Duplicate III
超時
class Solution:
def containsNearbyAlmostDuplicate(self,
219. Contains Duplicate II
219. Contains Duplicate II
這一題和 2 Sum 的原理有點像，我們需要用到 Table
651. 4 Keys Keyboard
651. 4 Keys Keyboard
這個題目滿有趣的，為了幫助大家對這個題目有更深的印象，我分享一個小故事，我在剛開始學寫程式的時候，是從 HTML