# 238. Product of Array Except Self **

63人阅读 评论(0)

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].

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

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：54235次
• 积分：3837
• 等级：
• 排名：第8644名
• 原创：332篇
• 转载：90篇
• 译文：0篇
• 评论：11条
最新评论