715. Range Module Hard

@problem@discussion
#Design#Segment Tree#Ordered Set



1/**
2 * [715] Range Module
3 *
4 * A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query about them.
5 * A half-open interval [left, right) denotes all the real numbers x where left <= x < right.
6 * Implement the RangeModule class:
7 * 
8 * 	RangeModule() Initializes the object of the data structure.
9 * 	void addRange(int left, int right) Adds the half-open interval [left, right), tracking every real number in that interval. Adding an interval that partially overlaps with currently tracked numbers should add any numbers in the interval [left, right) that are not already tracked.
10 * 	boolean queryRange(int left, int right) Returns true if every real number in the interval [left, right) is currently being tracked, and false otherwise.
11 * 	void removeRange(int left, int right) Stops tracking every real number currently being tracked in the half-open interval [left, right).
12 * 
13 *  
14 * Example 1:
15 * 
16 * Input
17 * ["RangeModule", "addRange", "removeRange", "queryRange", "queryRange", "queryRange"]
18 * [[], [10, 20], [14, 16], [10, 14], [13, 15], [16, 17]]
19 * Output
20 * [null, null, null, true, false, true]
21 * Explanation
22 * RangeModule rangeModule = new RangeModule();
23 * rangeModule.addRange(10, 20);
24 * rangeModule.removeRange(14, 16);
25 * rangeModule.queryRange(10, 14); // return True,(Every number in [10, 14) is being tracked)
26 * rangeModule.queryRange(13, 15); // return False,(Numbers like 14, 14.03, 14.17 in [13, 15) are not being tracked)
27 * rangeModule.queryRange(16, 17); // return True, (The number 16 in [16, 17) is still being tracked, despite the remove operation)
28 * 
29 *  
30 * Constraints:
31 * 
32 * 	1 <= left < right <= 10^9
33 * 	At most 10^4 calls will be made to addRange, queryRange, and removeRange.
34 * 
35 */
36pub struct Solution {}
37
38// problem: https://leetcode.com/problems/range-module/
39// discuss: https://leetcode.com/problems/range-module/discuss/?currentPage=1&orderBy=most_votes&query=
40
41// submission codes start here
42
43struct RangeModule {
44        vec![]
45    }
46
47
48/** 
49 * `&self` means the method takes an immutable reference.
50 * If you need a mutable reference, change it to `&mut self` instead.
51 */
52impl RangeModule {
53
54    fn new() -> Self {
55        
56    }
57    
58    fn add_range(&self, left: i32, right: i32) {
59        
60    }
61    
62    fn query_range(&self, left: i32, right: i32) -> bool {
63        
64    }
65    
66    fn remove_range(&self, left: i32, right: i32) {
67        
68    }
69}
70
71/**
72 * Your RangeModule object will be instantiated and called as such:
73 * let obj = RangeModule::new();
74 * obj.add_range(left, right);
75 * let ret_2: bool = obj.query_range(left, right);
76 * obj.remove_range(left, right);
77 */
78
79// submission codes end
80
81#[cfg(test)]
82mod tests {
83    use super::*;
84
85    #[test]
86    fn test_715() {
87    }
88}
89


Back
© 2025 bowen.ge All Rights Reserved.