Range Sum Query - Immutable

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

Example:

Given nums = [-2, 0, 3, -5, 2, -1]

sumRange(0, 2) -> 1
sumRange(2, 5) -> -1
sumRange(0, 5) -> -3

class NumArray {
public:
    vector<int> sums;
    //初始化时把和算出来，减少重复调用的计算开销
    NumArray(vector<int> &nums) {
        
        sums.reserve(nums.size());  //设置vector的预留空间大小
        
        if(nums.size()>=1){
            sums.push_back(nums[0]);    //利用push_back函数添加元素
            for (int i = 1;i<nums.size();i++){
                sums.push_back(sums[i-1] + nums[i]);
            }
        }
    }

    int sumRange(int i, int j) {
        if(i>j || i<0 || j> sums.size())
            return 0;
        else if(i == 0){
            return sums[j];
        }else{
            return sums[j] - sums[i-1];
        }
    }
};


// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);