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

原题链接：Leecode 303. 区域和检索 - 数组不可变

class NumArray {
public:
    vector<int> v;
    NumArray(vector<int>& nums) {
        int n=nums.size();
        v.resize(n);
        v[0]=nums[0];
        for(int i=1;i<n;i++)
        {
            v[i]=v[i-1]+nums[i];
        }
    }
    
    int sumRange(int left, int right) {
        if(!left) return v[right];
        return v[right]-v[left-1];
    }
};

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