Range Sum Query - Immutable---求数组任意区间的所有数字之和

Given an integer array nums, find the sum of the elements between indices iand 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.

思路：
这道题让我们检索数组任意区间的所有数字之和，我们用数组dp[i]来表示区间[0,i]的和值，那么区间[i,j]的和值即可用dp[j]-dp[i-1]来表示，还要注意一下边界问题，即当i=0的时候，直接返回dp[j]
class NumArray {
public:
NumArray(vector &nums) {
dp = nums;
for (int i = 1; i < nums.size(); ++i) {
dp[i] += dp[i - 1];
}
}
int sumRange(int i, int j) {
return i == 0? dp[j] : dp[j] - dp[i - 1];
}
private:
vector dp;
};

代码：

class numarry {
private: vector<int> dp;//存储累加和的数组
public :
     numarry(vector<int>&nums)
     {
       dp = nums;//接收输入的数组
       for(int i=1;i<nums.size();++i)
         {
           dp[i]+=dp[i-1];//将每个位置的累加和存储在dp数组中
          }
     }
    int sumRange(int i,int j)
    {
      return i==0?dp[j]:dp[j]-dp[i-1]; //i=0时，直接返回dp[J]
    }
     
}