算法
LvTzTz
这个作者很懒,什么都没留下…
展开
-
动态规划:经典数字倒三角问题
题目1在倒三角形中找到一条从顶点到底边的路径,使得路径上所有数字的和最大。路径上的每一步只能往左下或者往右下走,只需给出结果,不必给出具体的路径。代码:numbers = [[7], [3, 8], [8, 1, 0], [2, 7, 4, 4], [4, 5, 2, 6, 5]]def biggest_number_dpfunc(layers, numbers): best_temp_result = [] fo原创 2020-11-26 17:09:09 · 710 阅读 · 0 评论 -
跳棋游戏(求最大升序子序列和)
The game can be played by two or more than two players. It consists of a chessboard(棋盘)and some chessmen(棋子), and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. I原创 2020-11-26 16:58:47 · 335 阅读 · 0 评论