利用backtrack思想，解决背包问题，旅行商问题，整数排序。展示给初学者思想的精髓~-Using backtrack thinking to solve knapsack problem, traveling salesman problem, integer sorting. Quintessence presented to beginners ~

背包问题的变形，解决背包最大装载问题。希望有所帮助-backpack maxloading

字符串匹配算法KMP的实现：KMP算法避免了指针的回溯，大大节省了前缀字符串重复带来的重复匹配时间-String matching algorithm KMP implementation: KMP algorithm to avoid the pointer backtrack, greatly saving the prefix string to repeat the repeated match time