[LeetCode303]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:

1. You may assume that the array does not change.
2. There are many calls to sumRange function.

给定一个数组，求从第i项到第j项的和。题目中提示给定的数组不变并且求从第i项到第j项的和的函数会被大量调用，因此考虑先把数组从下标为0开始到每一项的和先求出来，存到一个数组s中，这样一来，求从第i项到第j项的和只需要s[j]-s[i-1]即可。时间复杂度为O(n)。

class NumArray {
public:
    int a[100000],s[100000]={0};
    NumArray(vector<int> &nums) {
        int sum=0;
        for(int i=0;i<nums.size();i++)
        {
            a[i]=nums[i];
            sum+=nums[i];
            s[i]=sum;
        }
    }

    int sumRange(int i, int j) {
        return s[j]-s[i-1];
    }
};


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