leetcodeRange Sum Query - Immutable
来源:互联网 发布:淘宝怎么进卖家中心 编辑:程序博客网 时间:2024/06/18 15:11
//先走一遍C++吧,最近一直写Python,老忘记打分号
class NumArray { vector<int> mynums;public: NumArray(vector<int> &nums) { vector<int> tmp=nums; if(tmp.size()>=1) mynums.push_back(tmp[0]); for(int i = 1;i < tmp.size();i++) { mynums.push_back(mynums[i-1]+tmp[i]); } } int sumRange(int i, int j) { if(i == 0) return mynums[j]; else return mynums[j]-mynums[i-1]; }};// Your NumArray object will be instantiated and called as such:// NumArray numArray(nums);// numArray.sumRange(0, 1);// numArray.sumRange(1, 2);这是我写的,速度一般般吧
看到有个大神写的,超级简练
class NumArray {private: vector<int> acc; public: NumArray(vector<int> &nums) { acc.push_back(0); for (auto n : nums) { acc.push_back(acc.back() + n); } } int sumRange(int i, int j) { return acc[j + 1] - acc[i]; }};// Your NumArray object will be instantiated and called as such:// NumArray numArray(nums);// numArray.sumRange(0, 1);// numArray.sumRange(1, 2);很简练,不得不服。
0 0
- leetcodeRange Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- LeetCode_Range Sum Query - Immutable
- leetcode_Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- Range Sum Query - Immutable
- javascript setAttribute使用兼容
- 揭开 Growth Hacking 的神秘面纱(番外篇)+ 大结局
- HDU 2236 无题II 二分+最大匹配
- [TwistedFate]UICollectionView
- java中的集合之Collection(一)
- leetcodeRange Sum Query - Immutable
- libxml2的安装及使用
- leetcode Longest Valid Parentheses
- javascript 得到cookie
- C# XML文档
- 【M】【83】【leetcode题解】Flatten Binary Tree to Linked List
- HDU 1248 寒冰王座(完全背包)
- git忽略已经更改的文件
- 用JS阻止事件冒泡