303. 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
Note:
You may assume that the array does not change.
There are many calls to sumRange function.
这道题其实就是求出从0到后面的每个和，然后求中间区域的和的时候，直接相减即可
代码如下：

class NumArray {
public:
    vector<int>sums;
    NumArray(vector<int> nums) {
        if(nums.size()==0)return ;
        sums.push_back(nums[0]);
        for(int i=1;i<nums.size();i++){
            sums.push_back(sums[i-1]+nums[i]);
        }
    }

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

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