238. Product of Array Except Self **
来源:互联网 发布:软件系统投标书 编辑:程序博客网 时间:2024/06/07 10:34
Given an array of n integers where n > 1, nums
, return an arrayoutput
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]
.
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.
https://discuss.leetcode.com/topic/18864/simple-java-solution-in-o-n-without-extra-space
class Solution(object): def productExceptSelf(self, nums): """ :type nums: List[int] :rtype: List[int] """ n = len(nums) left = [1]*n right =[1]*n for i in range(1,len(nums)): left[i]= left[i-1] * nums[i-1] right [n-1-i] =right[n-i] * nums[n-i] return map(lambda (a,b):a*b, zip(left,right))
return map(lambda (a,b):a*b, zip(left,right))
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
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- [LeetCode]238. Product of Array Except Self
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- 238. Product of Array Except Self
- LeetCode *** 238. Product of Array Except Self
- LeetCode 238. Product of Array Except Self
- HDU 2041 超级楼梯 简单DP动态规划 递归
- 动画效果 android
- LeetCode攻关笔记——1.Two_Sum
- //HDU1848,SG函数,简单应用示例
- 阿狸的打字机
- 238. Product of Array Except Self **
- 【2015-2016】只为遇见更好的自己,我们各自奔天涯
- TextView图文混排
- 下拉刷新、上拉加载更多控件实现原理及解析
- leetcode_c++:Divide and Conquer:Count of Smaller Numbers After Self(315)
- Android View事件传递机制(一)
- Java 7之基础 - 强引用、弱引用、软引用、虚引用
- 网页乱码
- Python 生涯