← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.697Z

= 〈y1, y2, …, yn〉. Begin at b[m, n] and trace through the table by following the arrows.

Each “↖” encountered in an entry b[i, j] implies that xi = yj is an element of the LCS

that LCS-LENGTH found. This method gives you the elements of this LCS in reverse order. T

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea