leetcode 刷题计划

  1. 以 Lintcode 题号刷题(基础题部分+提高部分)
    1. 1. Beginning (4 + 3)
    2. 2. Binary Search & Log(n) Algorithm (10 + 18)
    3. 3. 2 Pointers (10 + 17)
    4. 4. BFS / Topological Sort (10 + 14)
    5. 5. Binary Tree (10 + 18)
    6. 6. DFS (19 + 18)
    7. 7. Data Structure I & II (22 + 43)
    8. 8. DP (10 + 7)
    9. 9. slid windows
    10. 10 hash table
    11. Tags Abbreviated description
      1. 参考链接:

以 Lintcode 题号刷题(基础题部分+提高部分)

1. Beginning (4 + 3)

  • 627 409. Longest Palindrome
  • 667 516. Longest Palindromic Subsequence
  • 13 28. Implement strStr()
    841
  • 415 125. Valid Palindrome
  • 594 strStr II
  • 200 5. Longest Palindromic Substring

2. Binary Search & Log(n) Algorithm (10 + 18)

  • 457
  • 585 Maximum Number in Mountain Sequence
    459 141
    460 235 617
    447 254 586
  • 60 35. Search Insert Position
  • 428 50. Pow(x, n)
  • 28 74. Search a 2D Matrix
    160
    159 14 63
    140 414 437
  • 75 162. Find Peak Element
    61 183
  • 74
  • 38 240. Search a 2D Matrix II
    62 600

3. 2 Pointers (10 + 17)

  • 397 674. Longest Continuous Increasing Subsequence
  • 172 27. Remove Element
  • 453 114. Flatten Binary Tree to Linked List
    228 604 894
    607 56 625
  • 539 283. Move Zeroes
    609 610
    521 587 380
    464 533 102
    608 443 58
    143 461 103
    57 382
    31 148
    5 59

4. BFS / Topological Sort (10 + 14)

  • 433 200. Number of Islands
    242 573
  • 69 102. Binary Tree Level Order Traversal
    624 434
    615 618 600
    616 598 574
    611 531
    605 178
    137 431
    127 71
    7 70
    120 794

5. Binary Tree (10 + 18)

900 597 88
596 474 472
480 246 595
453 155 619
93 97 614
902 68 520
578 67 475
95 66 94
901 915
86 448

6. DFS (19 + 18)

  • 680 652
    136 570
    153 426
    152 427
  • 135 39. Combination Sum
    780
    18 683
    17 196
    582 107
    192 108
    154 190
    425 198
    10 197
    34 52
    33 51
    16 634
    15 828
    829 211
    132 123
    121

7. Data Structure I & II (22 + 43)

  • 642
  • 156 56. Merge Intervals
    495 165
    494 128 6
    209 685 817
    657 613 793
    612 606 665
    544 601 548
    104 545 405
    40 526 149
    4 486 139
    134 130 104
    839 129
  • 41 53. Maximum Subarray
    547 124 620
    138 551 617
  • 64 88. Merge Sorted Array
    494 191
    575 151
    944 541 150
    840 540 45
    654 528 42
    577 471 404
    486 224 393
    931 24 43
    65 943

8. DP (10 + 7)

  • 322. Coin Change
  • 115 Unique Paths II
    272
  • 114 62. Unique Paths
    630
    111 117
  • 110 64. Minimum Path Sum
  • 198. House Robber
  • 1406. Stone Game III
    602
    603 622
    611 254
    513 584
  • 116 55. Jump Game
    109
    76

9. slid windows

  • 647 438. Find All Anagrams in a String

10 hash table

  • 838 560. Subarray Sum Equals K

Tags Abbreviated description

  • A : Array
  • DP : Dynamic Programming
  • Str : String
  • M : Math
  • T : Tree
  • HT : Hash Table
  • DFS : Depth-first Search
  • BFS : Breadth-first Search
  • BS : Binary Search
  • TP : Two Pointers
  • B : Backtracking
  • LL : Linked List
  • D&C : Divide and Conquer
  • H : Heap
  • S : Sort
  • G : Greedy
  • BM : Bit Manipulation
  • St : Stack
  • Q : Queue
  • D : Design

参考链接:

  1. leetcode 分类刷题经验
  2. leetcode swift

请多多指教。

文章标题:leetcode 刷题计划

本文作者:顺强

发布时间:2019-11-18, 23:59:00

原始链接:http://shunqiang.ml/leetcode-leetcode-exercise/

版权声明: "署名-非商用-相同方式共享 4.0" 转载请保留原文链接及作者。

目录
×

喜欢就点赞,疼爱就打赏