题目
给你一个数组 nums ,请你完成两类查询,其中一类查询要求更新数组下标对应的值,另一类查询要求返回数组中某个范围内元素的总和。
实现 NumArray 类:
NumArray(int[] nums) 用整数数组 nums 初始化对象
void update(int index, int val) 将 nums[index] 的值更新为 val
int sumRange(int left, int right) 返回子数组 nums[left, right] 的总和(即,nums[left] + nums[left + 1], …, nums[right])
示例:
输入:
[“NumArray”, “sumRange”, “update”, “sumRange”]
[[[1, 3, 5]], [0, 2], [1, 2], [0, 2]]
输出:
[null, 9, null, 8]
解释:
NumArray numArray = new NumArray([1, 3, 5]);
numArray.sumRange(0, 2); // 返回 9 ,sum([1,3,5]) = 9
numArray.update(1, 2); // nums = [1,2,5]
numArray.sumRange(0, 2); // 返回 8 ,sum([1,2,5]) = 8
提示:
1 <= nums.length <= 3 * 104
-100 <= nums[i] <= 100
0 <= index < nums.length
-100 <= val <= 100
0 <= left <= right < nums.length
最多调用 3 * 104 次 update 和 sumRange 方法
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/range-sum-query-mutable
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解
线段树
class NumArray {
int[] tree = new int[70010];
int[] nums;
public NumArray(int[] nums) {
this.nums = nums;
build(nums,0,0,nums.length-1);
}
public void build(int[] nums,int node,int start,int end){
if(start==end){
tree[node] = nums[start];
return;
}
int mid=(start+end)/2;
int left_node = 2*node+1;
int right_node = 2*node+2;
build(nums,left_node,start,mid);
build(nums,right_node,mid+1,end);
tree[node] = tree[left_node]+tree[right_node];
}
public void update(int index, int val) {
update_tree(nums,0,0,nums.length-1,index,val);
}
public void update_tree(int nums[],int node,int start,int end,int idx,int val){
if(start==end){
nums[idx]=val;
tree[node]=val;
return;
}
int mid = (start+end)/2;
int left_node = 2*node+1;
int right_node = 2*node+2;
if(idx>=start&&idx<=mid) update_tree(nums,left_node,start,mid,idx,val);
else update_tree(nums,right_node,mid+1,end,idx,val);
tree[node]=tree[left_node]+tree[right_node];
}
public int sumRange(int left, int right) {
return query_tree(nums,0,0,nums.length-1,left,right);
}
public int query_tree(int nums[],int node,int start,int end,int L,int R){
if(R<start||L>end) return 0;
else if(L<=start&&end<=R) return tree[node];
else if(start==end) return tree[node];
int mid = (start+end)/2;
int left_node = 2*node+1;
int right_node = 2*node+2;
int sum_left = query_tree(nums,left_node,start,mid,L,R);
int sum_right = query_tree(nums,right_node,mid+1,end,L,R);
return sum_left+sum_right;
}
}