Approach 1: Brute Force
- Time:Constructor: O(1), book(start: int, end: int): O(n^2)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Approach 2: Ordered Map
- Time:Constructor: O(1), book(start: int, end: int): O(n\log n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|