[Leetcode]Range Sum Query - Immutable
2015-11-23 15:11
525 查看
Given an integer array nums, find the sum of the elements between indices
i and j (i ≤ j), inclusive.
Example:
Note:
You may assume that the array does not change.
There are many calls to sumRange function.
class NumArray {
private:
vector<int>sumArray;
public:
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) {
int ret = sumArray[j];
if(i > 0){
ret -= sumArray[i-1];
}
return ret;
}
};
// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);
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.
class NumArray {
private:
vector<int>sumArray;
public:
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) {
int ret = sumArray[j];
if(i > 0){
ret -= sumArray[i-1];
}
return ret;
}
};
// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);
相关文章推荐
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例
- PHP实现克鲁斯卡尔算法实例解析
- C#获取关键字附近文字算法实例