leetcode 238. Product of Array Except Self
来源:互联网 发布:软件项目绩效考核指标 编辑:程序博客网 时间:2024/06/07 12:07
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 ofnums
except nums[i]
.
Solve it without division and in O(n).
For example, given [1,2,3,4]
, return [24,12,8,6]
.
这道题主要是不能用除法(用除法要判断除数是否为零,以及几个零),所以维持两个数组,一个表示左边的积一个表示右边的积。
class Solution {public: vector<int> productExceptSelf(vector<int>& nums) { int sz = nums.size(); vector<int> left(sz, 1); vector<int> right(sz, 1); for(int i=1; i < sz; i++){ left[i] = left[i-1] * nums[i-1]; right[sz-1-i] = right[sz-i] * nums[sz-i]; } vector<int> res(sz, 1); for(int i = 0; i < sz; i++){ res[i] = left[i] * right[i]; } return res; }};
0 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
- js继承方法
- CF gym100851B-Generators/POJ1018-Communication System
- echarts2中dataRange不显示的问题和加载loading的使用
- Pro Git笔记
- 深度学习与计算机视觉系列(8)_神经网络训练与注意点
- leetcode 238. Product of Array Except Self
- Ubuntu下常用但是我容易忘记的命令总结(未完待续)
- java实现输入一个整数,输出该数二进制表示中1的个数(其中负数用补码表示)--《剑指offer》
- 生命不息,战斗不止。
- 算法练习7
- Gilde加载圆形图像、加载gif图像
- 深度学习与计算机视觉系列(9)_串一串神经网络之动手实现小例子
- Swift中可选项的总结
- linux目录