【leetcode】303. Range Sum Query - Immutable

题目：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

---

思路：
保存每个数字的前n项和。

---

代码实现：

class NumArray {
public:
    vector<int> dp;
    NumArray(vector<int>& nums): dp(nums.size(),0){
        if (nums.size() > 0){
            dp[0] = nums[0];
            for (int i = 1; i < nums.size(); ++i){
                dp[i] = dp[i-1] + nums[i];
            }
        }
        
    }
    
    int sumRange(int i, int j) {
        if (i == 0){
            return dp[j];
        }
        return dp[j]-dp[i-1];
    }
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(i,j);
 */

---

参考：
https://www.cnblogs.com/fengxw/p/6083950.html