lintcode 943. 区间和查询 - Immutable

给一个整数数组 nums，求出下标从 i 到 j 的元素和(i ≤ j)，i 跟 j对应的元素也包括在内。

样例1

输入: nums = [-2, 0, 3, -5, 2, -1]
sumRange(0, 2)
sumRange(2, 5)
sumRange(0, 5)
输出:
1
-1
-3
解释: 
sumRange(0, 2) -> (-2) + 0 + 3 = 1
sumRange(2, 5) -> 3 + (-5) + 2 + (-1) = -1
sumRange(0, 5) -> (-2) + 0 + 3 + (-5) + 2 + (-1) = -3

样例2

输入: 
nums = [-4, -5]
sumRange(0, 0)
sumRange(1, 1)
sumRange(0, 1)
sumRange(1, 1)
sumRange(0, 0)
输出: 
-4
-5
-9
-5
-4
解释: 
sumRange(0, 0) -> -4
sumRange(1, 1) -> -5
sumRange(0, 1) -> (-4) + (-5) = -9
sumRange(1, 1) -> -5
sumRange(0, 0) -> -4

class NumArray {
public:
    NumArray(vector<int> nums) {
        m_nums=nums;
    }
    
    int sumRange(int i, int j) {
        int sum=0;
        while(i<=j)
        {
            sum+=m_nums[i];
            i++;
        }
        return sum;
    }
private:
    vector<int> m_nums;
};