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.

使用STL库，简化实现。

class NumArray {
public:
	NumArray(vector<int>& nums) {
		myNums = nums;
	}

	int sumRange(int i, int j) {
		return accumulate(myNums.begin() + i, myNums.begin() + j + 1, 0);
	}
private:
	vector<int> myNums;
};