Yingying

你必须非常努力,才能看起来毫不费力

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

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

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/alwaystry/article/details/52346142
个人分类: leetcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

238. Product of Array Except Self **

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭