LeetCode 分類刷題 —— Two Pointers

Two Pointers 的 Tips:

  • 雙指針滑動窗口的經(jīng)典寫法。右指針不斷往右移,移動到不能往右移動為止(具體條件根據(jù)題目而定)。當(dāng)右指針到最右邊以后,開始挪動左指針,釋放窗口左邊界。第 3 題,第 76 題,第 209 題,第 438 題,第 567 題,第 713 題,第 763 題,第 845 題,第 881 題,第 904 題,第 992 題,第 1004 題。
    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)
    }
  • 快慢指針可以查找重復(fù)數(shù)字,時間復(fù)雜度 O(n),第 287 題。
  • 替換字母以后,相同字母能出現(xiàn)連續(xù)最長的長度。第 424 題。
  • SUM 問題集。第 1 題,第 15 題,第 16 題,第 18 題,第 167 題,第 923 題。
Title Solution Difficulty Time Space 收藏
3. Longest Substring Without Repeating Characters Go Medium O(n) O(1) ??
11. Container With Most Water Go Medium O(n) O(1)
15. 3Sum Go Medium O(n^2) O(n) ??
16. 3Sum Closest Go Medium O(n^2) O(1) ??
18. 4Sum Go Medium O(n^3) O(n^2) ??
19. Remove Nth Node From End of List Go Medium O(n) O(1)
26. Remove Duplicates from Sorted Array Go Easy O(n) O(1)
27. Remove Element Go Easy O(n) O(1)
28. Implement strStr() Go Easy O(n) O(1)
30. Substring with Concatenation of All Words Go Hard O(n) O(n) ??
42. Trapping Rain Water Go Hard O(n) O(1) ??
61. Rotate List Go Medium O(n) O(1)
75. Sort Colors Go Medium O(n) O(1) ??
76. Minimum Window Substring Go Hard O(n) O(n) ??
80. Remove Duplicates from Sorted Array II Go Medium O(n) O(1
86. Partition List Go Medium O(n) O(1) ??
88. Merge Sorted Array Go Easy O(n) O(1) ??
125. Valid Palindrome Go Easy O(n) O(1)
141. Linked List Cycle Go Easy O(n) O(1) ??
142. Linked List Cycle II Go Medium O(n) O(1) ??
167. Two Sum II - Input array is sorted Go Easy O(n) O(1)
209. Minimum Size Subarray Sum Go Medium O(n) O(1)
234. Palindrome Linked List Go Easy O(n) O(1)
283. Move Zeroes Go Easy O(n) O(1)
287. Find the Duplicate Number Go Easy O(n) O(1) ??
344. Reverse String Go Easy O(n) O(1)
345. Reverse Vowels of a String Go Easy O(n) O(1)
349. Intersection of Two Arrays Go Easy O(n) O(n)
350. Intersection of Two Arrays II Go Easy O(n) O(n)
424. Longest Repeating Character Replacement Go Medium O(n) O(1)
524. Longest Word in Dictionary through Deleting Go Medium O(n) O(1)
532. K-diff Pairs in an Array Go Easy O(n) O(n)
567. Permutation in String Go Medium O(n) O(1) ??
713. Subarray Product Less Than K Go Medium O(n) O(1)
763. Partition Labels Go Medium O(n) O(1) ??
826. Most Profit Assigning Work Go Medium O(n log n) O(n)
828. Unique Letter String Go Hard O(n) O(1) ??
838. Push Dominoes Go Medium O(n) O(n)
844. Backspace String Compare Go Easy O(n) O(n)
845. Longest Mountain in Array Go Medium O(n) O(1)
881. Boats to Save People Go Medium O(n log n) O(1)
904. Fruit Into Baskets Go Medium O(n log n) O(1)
923. 3Sum With Multiplicity Go Medium O(n^2) O(n)
925. Long Pressed Name Go Easy O(n) O(1)
930. Binary Subarrays With Sum Go Medium O(n) O(n) ??
977. Squares of a Sorted Array Go Easy O(n) O(1)
986. Interval List Intersections Go Medium O(n) O(1)
992. Subarrays with K Different Integers Go Hard O(n) O(n) ??
1004. Max Consecutive Ones III Go Medium O(n) O(1)
1093. Statistics from a Large Sample Go Medium O(n) O(1)
最后編輯于
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點,簡書系信息發(fā)布平臺,僅提供信息存儲服務(wù)。

推薦閱讀更多精彩內(nèi)容

  • 動態(tài)規(guī)劃 111. 爬樓梯思路類似斐波那契數(shù)列注意考慮第 0 階的特殊情況 272. 爬樓梯 II思路類似上題,只...
    6默默Welsh閱讀 2,451評論 0 1
  • 選擇題部分 1.(),只有在發(fā)生短路事故時或者在負荷電流較大時,變流器中才會有足夠的二次電流作為繼電保護跳閘之用。...
    skystarwuwei閱讀 13,291評論 0 7
  • RocketMQ安裝 安裝條件 Linux服務(wù)器 maven JAVA環(huán)境配置 git(使用git安裝的情況下) ...
    Lacia閱讀 11,275評論 13 1
  • 以前使用OC創(chuàng)建自定義的view步驟相信都知道怎么弄,最近在寫swift遇到一些以為很簡單的實際上還是和OC不同的...
    Mr_Coii閱讀 4,799評論 1 3
  • 越來越喜歡有趣和溫柔的人了,溫柔真的很迷人啊。對人禮貌又不賣弄,會去照顧別人的感受,時不時逗我笑一下啦,溫溫柔柔的...
    smilling_微笑閱讀 34評論 0 1