Wednesday, October 5, 2011

Intervals

Given a list of non overlapping intervals, design a data structure for inserting, finding and deleting them (e.g. [10, 30), [35, 50), [70, 100) ...)
Pubblicato da a
Reazioni: 

2 commenti:

Subscribe to: Post Comments (Atom)