claw16/leetcode-notes

Notes for LeetCode problems, algorithms, and data structures.

刷题小本子

我的题解

备忘：

20190824:

• Implement in / pre / post order traversal of BST using stack.
• Validate BST分治法
• 字符串查找算法学习：KMP, Horspool's

20190826:

• Further optimize LRU cache problem code.

20190828:

• Optional: complete 901. Closest Binary Search Tree Value II

20190829:

• Review codes of Quicksort and sort colors, carefully go through examples to see why some conditions are different.
• Important: Review Lomuto's and Hoare's partition.

20190831:

• DP, LC669, 114, 116, maximum product subarray

20190901:

• 76, 109

20190902:

• Exam questions: 1712, 1600, 1592, 1162, 1012, 910

20190905::

• Q 125.
• Continue backpack 4 lectures.

20190907:

• 18, 17, 15

20190908:

• 829, 121
• 104. Merge K Sorted Lists, use merge sort to solve the problem.

20190909:

• ugly number ii - heap and DP

20190923:

• 115,

20191001:

• 512