贪心算法

• 1. 学习内容
  • 1.1 参考
• 5. 区间划分问题（Interval Partitioning）
• Huffman Codes
• Minimum Spanning Trees

1. 学习内容

1.1 参考

1. （待整理）kent.edu

5. 区间划分问题（Interval Partitioning）

1. 畜栏保留问题

Huffman Codes

Huffman code is a technique for compressing data. Huffman’s greedy algorithm look at the occurrence of each character and it as a binary string in an optimal way. Huffman Codes

Minimum Spanning Trees