LeetCode307. Range Sum Query - Mutable

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

The update(i, val) function modifies nums by updating the element at index i to val.

Example:

Given nums = [1, 3, 5]

sumRange(0, 2) -> 9
update(1, 2)
sumRange(0, 2) -> 8

Note:

1. The array is only modifiable by the update function.
2. You may assume the number of calls to update and sumRange function is distributed evenly.

这道题我们在调用范围求和的时候使用累加就可以了。

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

	void update(int i, int val) {
		myNums[i] = val;
	}

	int sumRange(int i, int j) {
		int sum = 0;
		for (int id = i; i <= j; id++) {
			sum += myNums[id];
		}
		return sum;
	}
private:
	vector<int> myNums;
};