题目: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题意:数组中任意两个下标组成的闭区间的和。
1.属于动态规划问题范畴
class NumArray {
public:
vector<int> num;
vector<int> dp;
NumArray(vector<int> nums) {
int n=nums.size();
dp=vector<int>(n,0); //用来存储从开头到i的数据累加和
num=nums;
for(int i=0;i<n;i++)
{
if(i>0)
dp[i]=dp[i-1]+nums[i];
else
dp[0]=nums[0];
}
}
int sumRange(int i, int j) {
return dp[j]-dp[i]+num[i];
}
};