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.

s思路：
1. array不变，就好办。先把所有的[0,i]区间的和计算出来。这需要o(n)的时间；然后以后收到[i,j]，则可以数学转换一下，用[0,j]-[0,i-1]得到。复杂度都是o(1).

class NumArray {
private:
    vector<int> res;
public:
    NumArray(vector<int> nums) {
        res=nums;
        for(int i=1;i<nums.size();i++){
            res[i]=res[i-1]+nums[i];
        }
    }

    int sumRange(int i, int j) {
        if(i==0) return res[j];
        return res[j]-res[i-1];
    }
};

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