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.

解题思路：

使用一个辅助数组m_rangeSum保存数组nums的[0,i]元素的sum，则sumRange(i,j)=m_rangeSum[j]-m_rangeSum[i]+nums[i]

AC代码如下：

class NumArray {
public:
	NumArray(vector<int> &nums){
		int n = nums.size();
		if (n > 0){
			m_nums = nums;
			m_rangeSum = vector<int>(n, 0);
			for (int i = 0; i < n; ++i){
				if (i == 0) m_rangeSum[i] = nums[i];
				else m_rangeSum[i] = m_rangeSum[i - 1] + nums[i];
			}
		}
	}

	int sumRange(int i, int j) {
		int n = m_rangeSum.size();
		if (i<0 || i>n || j<0 || j>n || i > j) return 0;
		return m_rangeSum[j] - m_rangeSum[i]+m_nums[i];
	}
private:
	vector<int> m_rangeSum;
	vector<int> m_nums;
};