Leetcode Algorithms - Dynamic Programming：303. Range Sum Query - Immutable

Description

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.

代码

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

    int sumRange(int i, int j) {
        return d[j + 1] - d[i];
    }
private:
    int *d;
};

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

分析

设d(i)表示从开始的数计算到第i位数的连续和。计算完所有的d(i)后，只需要将两个索引i和j对应的连续和相减就可以得出答案。是道很简单的题目。
由于测试样例中好像有nums为空的情况，最开始的代码会造成使用空指针，所以最后干脆多弄了个d(0)=0，代表不做第0位数前的连续和，通过d(j+1)-d(i)求区间和。