303. Range Sum Query - Immutable

题目

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

题意

给定一个数组,
求数组[i, j]之和(会被调用多次)

分析

首先在构造函数中将数组[0, i]的和求出来, 保存到dp[i]中.
然后每次求数组[i, j]之和, 就等价于dp[j+1] - dp[i]

代码

class NumArray {
public:
    NumArray(vector<int> nums) {
        n = nums.size();
        dp.resize(n+1);
        for (int i = 1; i <= n; i++) {
            dp[i] = dp[i-1] + nums[i-1];
        }
    }

    int sumRange(int i, int j) {
        if (i < 0 || i >= n) return 0;
        return dp[j+1] - dp[i];
    }
    vector<int> dp;
    int n;
};

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