LeetCode 303. Range Sum Query - Immutable

题目链接：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.

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> numarray;
    NumArray(vector<int> &nums) {
        numarray=nums;
    }

    int sumRange(int i, int j) {
        int re=0;
        for(int k=i;k<=j;k++)
        {
            re+=numarray[k];
        }
        return re;
    }
};


// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);

注意note里提到的： 对于sumRange会有很多次调用，用上面的方法就不合适了，构造函数也许写，把 累加的和可以在构造函数中存储起来，这样调用sumRange时只需简单的操作sumRange(i,j)=sum[j]-sum[i-1]

代码：

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