Leetcode 238. Product of Array Except Self
来源:互联网 发布:摄氏 华氏 转换vb 编程 编辑:程序博客网 时间:2024/06/15 14:43
Given an array of n integers where n > 1, nums
, return an array output
such that output[i]
is equal to the product of all the elements of nums
except nums[i]
.
Solve it without division and in O(n).
For example, given [1,2,3,4]
, return [24,12,8,6]
.
Follow up:
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)
两个量分别统计前缀数组乘积和后缀数组乘积,每一个位置的值为前缀和后缀的乘积相乘。
class Solution {public: vector<int> productExceptSelf(vector<int>& nums) { vector<int> res(nums.size(), 1); int s = 1, e = 1; int n = nums.size(); for(int i = 0; i < nums.size(); i++) { res[i] *= s; s *= nums[i]; res[n - 1 - i] *= e; e *= nums[n - 1 - i]; } return res; }};
1 0
- [leetcode] 238.Product of Array Except Self
- [LeetCode]238.Product of Array Except Self
- [leetcode] 238. Product of Array Except Self
- Leetcode 238. Product of Array Except Self
- [LeetCode]238. Product of Array Except Self
- 238. Product of Array Except Self LeetCode
- LeetCode 238. Product of Array Except Self
- [LeetCode]238. Product of Array Except Self
- LeetCode *** 238. Product of Array Except Self
- LeetCode 238. Product of Array Except Self
- 【leetcode】238. Product of Array Except Self
- leetcode-238. Product of Array Except Self
- Leetcode 238. Product of Array Except Self
- 【leetcode】238. Product of Array Except Self
- LeetCode- 238. Product of Array Except Self
- leetcode 238. Product of Array Except Self
- 【leetcode】238. Product of Array Except Self
- leetcode:238. Product of Array Except Self
- I/O多路复用
- 2016.10.29
- python exercise12
- IMvxMessenger
- 3.4(类的继承,类的多态,泛型类)
- Leetcode 238. Product of Array Except Self
- 51nod 1119 机器人走方格 v2
- 第一个app
- viewpager实现画廊(中间图片全部显示,左右显示一部分b布局)无限轮播效果
- Linux的source
- greenDAO使用步骤(Android时下最流行数据库框架)
- mac终端命令,adb,svn命令总结
- 为什么说NULL未声明?
- 对caffe做mnist错误识别样本输出的过程记录