贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的仅是在某种意义上的局部最优解。贪心算法不是对所有问题都能得到整体最优解，但对范围相当广泛的许多问题他能产生整体最优解或者是整体最优解的近似解。-Greedy algorithm (also known as the greedy algorithm) refers to when to problem solving, always seems to be made in the current best choice. That is, not be optimal from the viewpoint of the whole, he is only made in the local optimal in some sense. Greedy algorithm is not all problems can be overall optimal solution, but for a wide range of many of the problems that he could produce an overall optimal solution is the overall optimal solution or approximate solution.