238. Product of Array Except Self **

原创 2016年08月28日 15:45:53

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.

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 OJ> 238. Product of Array Except Self

238. Product of Array Except Self My Submissions Question Total Accepted: 31438 Total Submission...

LeetCode笔记:238. Product of Array Except Self

计算除了该元素以外所有元素的乘积

LeetCode-238. Product of Array Except Self (JAVA)(构建乘积数组)

LeetCode-238. Product of Array Except Self (JAVA)(构建乘积数组) 剑指offer

Leetcode_238_Product of Array Except Self

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/48598939 Given an array of...

LeetCode- 238. Product of Array Except Self

Problem: Given an array of n integers where n > 1, nums, return an array output such that outpu...

[LC238] Product of Array Except Self

238. Product of Array Except Self Given an array of n integers where n > 1, nums, return an array ...

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

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

LeetCode 238 Product of Array Except Self(除自身外数组其余数的乘积)

翻译给定一个有n个数字的数组nums,其中n大于1,返回一个数组使得output[i]等于除nums[i]外所有元素的乘积。不用分治并且在O(n)复杂度下解决这个问题。例如,给定[1, 2, 3, 4...
  • NoMasp
  • NoMasp
  • 2016年03月05日 20:38
  • 1993

LeetCode 238. Product of Array Except Self 题解(C++)

LeetCode 238. Product of Array Except Self 题解(C++)题目描述 Given an array of n integers where n > 1, num...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:238. Product of Array Except Self **
举报原因:
原因补充:

(最多只允许输入30个字)