307. 区域和检索 - 数组可修改

给你一个数组 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]) = 9

提示：

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 方法
通过次数17,461提交次数30,399

class NumArray {
public:
    NumArray(vector<int>& nums) {
        if(nums.size()){
            size=nums.size();
            tree=new int[4*size];
            data=new int[size];

            for(int i=0;i<size;i++) {
                data[i] = nums[i];
            }

            buildSegmentTree(0,0,size-1); 
        }
    }

     void update(int index, int val) {
        data[index]=val;
        set(0,0,size-1,index,val);
    }
    
    int sumRange(int i, int j) {
        return query(0,0,size-1,i,j);
    }

private:
    void set(int treeIndex,int l,int r,int index,int e){

        if(l==r){
            tree[treeIndex]=e;
            return ;
        }

        int leftIndex=leftchild(treeIndex);
        int rightIndex=rightchild(treeIndex);
        int mid=(l+r)/2;

        if(index>=mid+1){
            set(rightIndex,mid+1,r,index,e);
        }
        else{
             set(leftIndex,l,mid,index,e);
        }

        tree[treeIndex]=tree[leftIndex]+tree[rightIndex];

    }

    int leftchild(int index){
        return 2*index+1;
    }

    int rightchild(int index){
        return 2*index+2;
    }

    int query(int treeIndex,int l, int r,int queryL,int queryR){
        if(l==queryL&&r==queryR){
            return tree[treeIndex];
        }

        int leftIndex=leftchild(treeIndex);
        int rightIndex=rightchild(treeIndex);
        int mid=(l+r)/2;

        if(queryL>=mid+1){
            return query(rightIndex,mid+1,r,queryL,queryR);
        }
        else if(queryR<=mid){
            return query(leftIndex,l,mid,queryL,queryR);
        }

        return query(leftIndex,l,mid,queryL,mid)+query(rightIndex,mid+1,r,mid+1,queryR);
    }

    void buildSegmentTree(int treeIndex,int l,int r){
        if(l==r){
            tree[treeIndex]=data[l];
            //cout<<"单个数据"<<data[treeIndex]<<endl;
            return ;
        }
        //cout<<"treeIndex="<<treeIndex<<endl;

        int leftIndex=leftchild(treeIndex);
        int rightIndex=rightchild(treeIndex);

        int mid=(l+r)/2;
        //cout<<mid<<" "<<leftIndex<<" "<<rightIndex<<endl;
        buildSegmentTree(leftIndex,l,mid);
        buildSegmentTree(rightIndex,mid+1,r);
        tree[treeIndex]=tree[leftIndex]+tree[rightIndex];
        //cout<<tree[leftIndex]<<" "<<tree[rightIndex]<<endl;
    }

    int *data;
    int *tree;
    int size;
};
class NumArray {
public:
    int *sum;
    int *data;
    int size;

    NumArray(vector<int>& nums) {
        size=nums.size();

        sum=new int[size+1];
        data=new int[size];
        sum[0]=0;
          
        for(int i=1;i<=size;i++) {
            sum[i] =sum[i-1]+nums[i-1];
            data[i-1]=nums[i-1];
        }
    }
    
    int sumRange(int i, int j) {
        return sum[j+1]-sum[i];
    }

    
    void update(int index, int val) {
        data[index]=val;

        for(int i=index+1;i<=size;i++){
            sum[i]=sum[i-1]+data[i-1];
        }

    }
  
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * obj->update(index,val);
 * int param_2 = obj->sumRange(left,right);
 */
/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * obj->update(index,val);
 * int param_2 = obj->sumRange(left,right);
 */