里面用两种方法实现了骑士巡游问题，分别是回溯的方法，和贪心加回溯的方法。-There two ways to achieve a parade Cavalier problems are way back, and greedy plus retrospective approach.

贪心法会议安排，先对结束时间排序，然后依次取出最大子集。-Greedy schedule of meetings, the first sort of the end of time, to be followed by the largest subset removed.

花费最短时间旅游完全国所有5A级景点，并介绍了相关算法的使用，例如贪婪算法-Take the shortest time to travel the whole country all the 5A level scenic spots, and introduced the use of the related algorithms, such as greedy algorithm