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.
例如:
给定 nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange(2, 5) -> -1 sumRange(0, 5) -> -3注意:
1.你可以假定数组不会产生变化
2.有许多条调用sumRange的语句
不太懂这道题的意义所在。。。?设置了一个vector,里面第i个元素存的是从0~i个元素的和,在调用函数的时候只需要简单判断一下就好。
class NumArray {
public:
vector<int> temp;
NumArray(vector<int> &nums) {
if (!nums.empty())
{
temp.push_back(nums[0]);
for (int i = 1; i<nums.size(); i++)
temp.push_back(nums[i] + temp[i - 1]);
for (int i = 0; i < nums.size(); i++)
cout << temp[i] << endl;
}
}
int sumRange(int i, int j) {
if (temp.empty()) return 0;
if (i == 0) return temp[j];
else return temp[j] - temp[i-1];
}
};
// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);