说明：  斐波那契数列问题的递归和动态规划、换钱的最少货币数、换钱的方法数、最长递增子序列、汉诺塔问题、最长公共子序列问题、最小编辑代价、字符串的交错组成等问题的提出与解决。
(Recursion and dynamic programming of Fibonacci sequence problems, the minimum number of currencies for money exchange, the number of methods for money exchange, the longest increasing subsequence, hannotta problem, the longest common subsequence problem, the minimum editing cost, the staggered composition of strings and other problems were proposed and solved.)