Approach 1: Fenwick Tree
- Time:Constructor: O(n\log n), update(index: int, val: int): O(\log n), sumRange(left: int, right: int): O(\log n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|