303. 区域和检索 - 数组不可变

给定一个整数数组 nums，求出数组从索引 i 到 j（i ≤ j）范围内元素的总和，包含 i、j 两点。

实现 NumArray 类：

NumArray(int[] nums) 使用数组 nums 初始化对象
int sumRange(int i, int j) 返回数组 nums 从索引 i 到 j（i ≤ j）范围内元素的总和，包含 i、j 两点（也就是 sum(nums[i], nums[i + 1], … , nums[j])）

示例：

输入：
["NumArray", "sumRange", "sumRange", "sumRange"]
[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
输出：
[null, 1, -1, -3]

解释：
NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
numArray.sumRange(0, 2); // return 1 ((-2) + 0 + 3)
numArray.sumRange(2, 5); // return -1 (3 + (-5) + 2 + (-1)) 
numArray.sumRange(0, 5); // return -3 ((-2) + 0 + 3 + (-5) + 2 + (-1))

提示：

0 <= nums.length <= 104
-105 <= nums[i] <= 105
0 <= i <= j < nums.length
最多调用 104 次 sumRange 方法

```cpp
class NumArray {
public:

    int *sum;

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

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


/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(i,j);
 */

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); 
        }
    }
    
    int sumRange(int i, int j) {
        return query(0,0,size-1,i,j);
    }

private:

    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;
};


/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(i,j);
 */