[Leetcode] 303. Range Sum Query
来源:互联网 发布:扫码查真伪的软件 编辑:程序博客网 时间:2024/06/06 04:00
题目:
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) -> 1sumRange(2, 5) -> -1sumRange(0, 5) -> -3
Note:
- You may assume that the array does not change.
- There are many calls to sumRange function.
思路:
记录一个和数组sums,其中sums[j]表示从nums[0]到nums[j]的和。sums的状态转移方程是:sums[j] = sums[j - 1] + nums[j],可以通过对数组一遍扫描完成;计算i到j之间的和可以通过sums[i, j] = sums[j] - sums[i-1]获得。
代码:
class NumArray {public: NumArray(vector<int> nums) { // the time complexity is O(n) if (nums.size() > 0) { sums.push_back(nums[0]); for (int i = 1; i < nums.size(); ++i) { sums.push_back(sums[i - 1] + nums[i]); } } } int sumRange(int i, int j) { // the time complexity is O(1) if (i == 0) { return sums[j]; } else { return sums[j] - sums[i - 1]; } } private: vector<int> sums;};/** * Your NumArray object will be instantiated and called as such: * NumArray obj = new NumArray(nums); * int param_1 = obj.sumRange(i,j); */
阅读全文
0 0
- 303.[LeetCode]Range Sum Query
- LeetCode-303. Range Sum Query
- [LeetCode]303. Range Sum Query
- LeetCode#303. Range Sum Query
- leetcode 303. Range Sum Query
- [LeetCode]303. Range Sum Query
- LeetCode 303. Range Sum Query
- LeetCode 303. Range Sum Query
- LeetCode 303. Range Sum Query
- leetcode-303. Range Sum Query
- LeetCode 303. Range Sum Query
- leetcode.303.Range Sum Query
- leetcode 303. Range Sum Query
- leetcode 303. Range Sum Query
- [leetcode]: 303. Range Sum Query
- [Leetcode] 303. Range Sum Query
- [LeetCode]303. Range Sum Query
- leetcode 303. Range Sum Query
- Oracle中的Truncate和Delete语句
- Linux用户空间和内核空间详解
- 无向图最小生成树
- 关于IE8的坑 (不间断更新)
- 使用pip install lib时报错time out
- [Leetcode] 303. Range Sum Query
- 关于c#的unity3d中双问号操作符(??)无法正确判断null值的问题
- 简单的评价打分控件
- Android零基础入门第10节:开发IDE大升级,终于迎来了Android Studio
- Android6.0权限动态分配
- selenium 定位不到元素
- JS 中字符和 ASCII码转换函数
- 记录开发中遇到的问题
- 有向图的创建(邻接矩阵)