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,1,2…n项和保存，时间复杂度为O(n)；
算i到j（包括j）的和时直接用前j+1项和减去前i项和，时间复杂度为O(1)。

代码：

class NumArray {
public:
    NumArray(vector<int> &nums) {
        int n=nums.size();
        sums.resize(n+1);
        sums[0]=0;
        for (int i=0;i<n;i++)
        {
            sums[i+1]=sums[i]+nums[i];
        }

    }

    int sumRange(int i, int j) {
        return sums[j + 1] - sums[i];
    }
private:
    vector<int>sums;
};

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