← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

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

uced by LCS-LENGTH on the sequences X = 〈A, B, C, B, D, A, B〉 and Y = 〈B, D, C, A, B, A〉.

The running time of the procedure is Θ(mn), since each table entry takes Θ(1) time to compute.

LCS-LENGTH(X, Y, m, n) 1 let b[1 : m, 1 : n] and c[0 : m, 0 : n] be new tables 2 for i =

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea