[leetcode-303]Range Sum Query - Immutable

1、题目：

链接：https://leetcode.com/problems/range-sum-query-immutable/

内容：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

注意：

• You may assume that the array does not change.
• There are many calls to sumRange function.

2、分析：

该题重点在于对sumRange的调用次数很多，因此在存储数组时不能简单的赋值。此题中，我们用一个数组nums来接受构造函数的参数，nums中第i位存储的是参数中第0~i之间的和。

3、代码

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