问题描述:
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
示例:
Given nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange(2, 5) -> -1 sumRange(0, 5) -> -3问题分析:
问题要求i和j内的元素和,我们可以假设状态转换sum[i]表示到0到i的元素和,这里求nums中i到j的元素和就可以转换为sum中sum[j+1]与sum[i]的差。
过程详见代码:
class NumArray {
public:
vector<int> sum;
NumArray(vector<int> nums) {
for(int i = 1;i < nums.size();i++)
{
nums[i] = nums[i - 1] + nums[i];
}
nums.insert(nums.begin(),0);
sum = nums;
}
int sumRange(int i, int j) {
return sum[j+1]-sum[i];
}
};