##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
BIT vs Segment Tree
Given an integer array nums, implement: - update(index, val): Update nums[index] to val - sumRange(left, right): Return sum from left to right You solved this with segment trees.
Now solve it with Fenwick Trees. For range sum: .
Note: Fenwick Trees typically support "add delta" not "set value." To set, compute the delta: . Constraints: up to elements.
