Greedy common problems of "starting from 0 to make LeetCode"
1. Prefix tree (trie-tree)
·
Add prefix tree function
2. Greedy: How can the largest string of N strings be combined?
ab<ba,bc<cb => ac<ca
3. Greed: The least costly
Huffman coding problem.
Try to make every cut as close as possible on both sides, greedy and greedy,
greedy strategy without proof
4. Greedy: The most profitable
heap, which is the priority queue 
heap + comparator, generates a small root heap, a large root heap
5. There is one more question, which I talked about before when talking about stacking
6. Greedy: The most number of sessions. Greedy
at the start time. Greedy
at the short duration. Greedy
at the end time.
