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:

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

思路；这道题比较简单，主要是考查对类的了解。

代码：

class NumArray {
public:
    vector<int> newnums;
    NumArray(vector<int> nums) {
        for(int i =0;i<nums.size();i++)
        {
            newnums.push_back(nums[i]);
        }
        
    }
    
    int sumRange(int i, int j) {
        int result = 0;
        for(int k = i;k<=j;k++)
        {
            result = result + newnums[k];
        }
        return result;
    }
};


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