(LeetCode 303) Range Sum Query - Immutable
来源:互联网 发布:手机连接电脑软件 编辑:程序博客网 时间:2024/06/05 15:11
Q:
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.
给定一个整型数组,求给定下标
solution:
这道题最简单的方法就是每次输入
我们可以预先把数组前
那么
注意当
class NumArray {public: NumArray(vector<int> &nums) { int sum=0; for(int i = 0; i < nums.size(); i++){ sum+=nums[i]; sums.push_back(sum); } } int sumRange(int i, int j) { if(i==0)return sums[j]; return sums[j]-sums[i-1]; } vector<int>sums;};
1 0
- [leetcode-303]Range Sum Query - Immutable
- [leetcode-303]Range Sum Query - Immutable(java)
- leetcode 303: Range Sum Query - Immutable
- Range Sum Query - Immutable leetcode 303
- leetcode 303 : Range Sum Query - Immutable
- LeetCode 303 : Range Sum Query - Immutable (Java)
- LeetCode(303)Range Sum Query - Immutable
- [leetcode 303] Range Sum Query - Immutable
- 【LeetCode】303 Range Sum Query - Immutable
- 【LEETCODE】303-Range Sum Query - Immutable
- LeetCode 303:Range Sum Query - Immutable
- 【LeetCode-303】Range Sum Query - Immutable
- LeetCode 303 Range Sum Query - Immutable
- (LeetCode 303) Range Sum Query - Immutable
- leetcode 303 Range Sum Query - Immutable C++
- LeetCode 303 Range Sum Query - Immutable
- LeetCode--No.303--Range Sum Query - Immutable
- LeetCode No.303 Range Sum Query - Immutable
- LeetCode 300. Longest Increasing Subsequence
- Data转NSString
- disruptor的使用和分析
- get/post请求
- JCS的初步探究
- (LeetCode 303) Range Sum Query - Immutable
- 堆和栈的区别
- IOS中XML解析
- MySQL Workbench
- Python循环语句
- S5PV210的I2C控制器
- nyoj 448
- 蓝桥杯-动态规划-java算法训练 数字三角形
- 提高android gradle构建速度的努力