题目描述:
给定一个数组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]。不能使用除法。
解题思路:
运用动态规划的方法,得到前向乘积和后向乘积两个数组,每一次分别从前向和后向中取对应部分
# -*- coding:utf-8 -*-
class Solution:
def multiply(self, A):
# write code here
headMul = [1] * len(A)
for i in range(len(A)-1):
headMul[i+1] = headMul[i]*A[i]
backMul = [1] * len(A)
for j in range(len(A)-1, 0, -1):
backMul[j-1] = backMul[j]*A[j]
B = [headMul[i]*backMul[i] for i in range(len(A))]
return B