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.
Subscribe to see which companies asked this question.

---

思路

计算[i,j]的和本质上就是计算sum(j)-sum(i-1)，注意i为0的时候sum(i-1)为0

---

代码

class NumArray {
    vector<long> sumArray;
public:
    NumArray(vector<int> nums) {
        //考虑下溢出
        long sum = 0;
        for(size_t i=0;i<nums.size();i++)
        {
            sum+= nums[i];
            sumArray.push_back(sum);
        }
    }

    int sumRange(int i, int j) {
        //默认入参合法
        if(i <= 0)
        {
            return sumArray[j];
        }
        else
        {
            return sumArray[j] - sumArray[i-1];
        }
    }
};

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