lintcode_50. 数组剔除元素后的乘积

给定一个整数数组A。

定义B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]， 计算B的时候请不要使用除法。

 

样例

给出A=[1, 2, 3]，返回 B为[6, 3, 2]

从i处分割，前后都为求数组内元素连乘

class Solution:
    """
    @param: nums: Given an integers array A
    @return: A long long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
    """
    def productExcludeItself(self, nums):
        # write your code here
        B = []
        
        if len(nums) < 2:
            return [1]
        for i in range(len(nums)):
            B.append(self.mul_list(nums[:i])*self.mul_list(nums[i+1:]))
        
        return B
            
    def mul_list(self,x):
        ans = 1
        for i in x:
            ans = ans*i
        return ans

 

九章算法参考:

class Solution:
    """
    @param A: Given an integers array A
    @return: An integer array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
    """
    def productExcludeItself(self, A):
        length ,B  = len(A) ,[]
        f = [ 0 for i in xrange(length + 1)]
        f[ length ] = 1
        for i in xrange(length - 1 , 0 , -1):
            f[ i ] = f[ i + 1 ] * A[ i ]
        tmp = 1
        for i in xrange(length):
            B.append(tmp * f[ i + 1 ])
            tmp *= A[ i ]
        return B

 

 

转载于:https://www.cnblogs.com/zhangli-ncu/p/8022647.html