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 tosee which companies asked this question.
class NumArray {
public:
NumArray(vector<int> nums) {
for(int m=0; m<nums.size(); m++) {
exams.push_back(nums[m]);
}
}
int sumRange(inti, int j) {
int sum = 0;
for(int k=i;k<=j; k++) {
sum+= exams[k];
}
return sum;
}
private:
vector<int> exams;
};
/**
* Your NumArrayobject will be instantiated and called as such:
* NumArray obj = newNumArray(nums);
* int param_1 =obj.sumRange(i,j);
*/