Leetcode之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:

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

代码：

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

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