题目描述
给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。
//B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]
//从左到右算 B[i]=A[0]*A[1]*...*A[i-1]
//从右到左算B[i]*=A[i+1]*...*A[n-1]
# -*- coding:utf-8 -*-
class Solution:
def multiply(self, A):
# write code here
if not A:
return
length = len(A)
alist = [1] * length
for i in range(1, length):
alist[i] = alist[i-1] * A[i-1]
tmp = 1
for i in range(length-2,-1,-1):
tmp = tmp*A[i+1]
alist[i] *= tmp
return alist