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.
题目:求一个int数组某个区间所有int的和,并且会多次请求sumRange 函数。
思路:新增一个数组记录前n个数的累加和,则区间和 = 区间最后的累加和 - 区间最前的累加和。
如图,第一排为原数组,第二排为第累加和,addSum[i]为nums[i]之前的累加和。要求区间 i ~ j 的累计值,则用 j 的累计值减去 i 之前的累计值,即addSum[ j+1 ] - addsum[ i ];
代码:
class NumArray {
public:
vector<int> sum;
NumArray(vector<int>& nums) {
sum.push_back(0);
for(int i=0;i<nums.size();i++)
{
int temp = nums[i]+ sum[i];
sum.push_back(temp);
}
}
int sumRange(int i, int j) {
if(i > j) return 0;
return sum[j+1]-sum[i];
}
};