【题目描述】
给定一个数组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];)
【解题思路】
因为B[i]=A[0]·A[1]·…·A[i-1]·A[i+1]·…·A[n-1]
可以分成两部分的乘积,A[0]·A[1]·…·A[i-1] 和 A[i+1]·…·A[n-1],每一部分分别从前往后和从后往前遍历一遍数组进行累乘。
用Python实现的代码如下:
# -*- coding:utf-8 -*-
class Solution:
def multiply(self, A):
# write code here
if len(A) <= 1:
return 0
# 从前往后累乘
A_front = [A[0] for i in range(len(A))]
for i in range(1, len(A)):
A_front[i] = A[i] * A_front[i-1]
# 从后往前累乘
A_behind = [A[len(A)-1] for i in range(len(A))]
for i in range(len(A)-2, -1 , -1):
A_behind[i] = A[i] * A_behind[i+1]
B = [0 for i in range(len(A))]
for i in range(len(A)):
if i == 0:
B[i] = A_behind[i+1]
elif i == len(A) - 1:
B[i] = A_front[i-1]
else:
B[i] = A_front[i-1] * A_behind[i+1]
return B