class NumArray {
public:
vector<int> sums;
NumArray(vector<int>& nums) {
int n = nums.size();
sums.resize(n + 1);//设置前缀和数组,长度加一
for (int i = 0; i < n; i++) {
sums[i + 1] = sums[i] + nums[i];//例如:3的前缀和等于2的前缀和加第二项
}
}
int sumRange(int i, int j) {
return sums[j + 1] - sums[i];//求0到3的和等于4的前缀和减去0的前缀和,只剩下0,1,2,3项
}
};
/**
* Your NumArray object will be instantiated and called as such:
* NumArray* obj = new NumArray(nums);
* int param_1 = obj->sumRange(left,right);
*/
输入:
["NumArray", "sumRange", "sumRange", "sumRange"]
[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
输出:
[null, 1, -1, -3]
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/range-sum-query-immutable