题目:
给定一个数组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[0] = A[1] * A[2] * … * A[n-1],B[n-1] = A[0] * A[1] * … * A[n-2];)
思路一:
暴力解法
代码:
class Solution:
def multiply(self, A):
B = [1]*len(A)
for i in range(len(B)):
for j in range(len(A)):
if j == i: continue
B[i] *= A[j]
return B
思路二:
分为上下三角连乘
代码:
class Solution:
def multiply(self, A):
n = len(A)
B = [1]*n
for i in range(1, n):
B[i] = B[i-1]*A[i-1]
temp = 1
for i in range(n-2, -1, -1):
temp *= A[i+1]
B[i] *= temp
return B