###### 238. Product of Array Except Self **

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))

#### LeetCode 238： Product of Array Except Self

2015-07-27 18:51:41

#### leetcode 238: Product of Array Except Self

2015-07-16 14:40:04

#### [LeetCode]Product of Array Except Self,解题报告

2015-07-17 10:20:32

#### LeetCode238Product of Array Except Self

2016-09-23 22:02:19

#### 238. Product of Array Except Self

2016-02-24 10:09:12

#### 238. Product of Array Except Self。

2018-01-05 16:08:55

#### [LC][Array]238. Product of Array Except Self

2017-11-19 11:16:10

#### 238. Product of Array Except Self [medium] (Python)

2016-07-30 11:46:33

#### 【LeetCode】238. Product of Array Except Self

2016-05-30 11:51:09

#### LeetCode *** 238. Product of Array Except Self

2016-04-06 19:31:08

## 不良信息举报

238. Product of Array Except Self **