【LintCode 简单】50. 数组剔除元素后的乘积

1.问题描述：

给定一个整数数组A。

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

2.样例:

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

3.代码：

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
        n = len(nums)
        B=[]
        accumulate = 1
        count=0
        for i in range(n):
            if nums[i]!=0:
                accumulate = accumulate * nums[i]
            else:
                count+=1
        # no zero in array A
        if count==0:
            for j in range(n):
	            B.append(int(accumulate / nums[j]))
        else:
            for j in range(n):
                # only one zero
                if nums[j]==0 and count==1:
                    B.append(accumulate)
                # more than one zero
                else:
                    B.append(0)
        return B