← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

17 第17章 数据结构的扩张

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

ject i with attributes i.low = t1 (the low endpoint) and i.high = t2 (the high endpoint).

We say that intervals i and i′ overlap if i ∩i′ ≠ ∅, that is, if i.low ≤ i′.high and i′.low ≤ i.high.

Figure 17.3 The interval trichotomy for two closed intervals i and i′. (a) If i and i′ ov

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea