51.构建乘积数组
题目描述
给定一个数组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[0] = A[1] * A[2] * A[3] * A[4] *…*A[n-1] ;(无A[0])
B[1 ]= A[0] * A[2] * A[3] * A[4] *…*A[n-1] ;(无A[1])
B[2] = A[0] * A[1] * A[3] * A[4] *…*A[n-1] ;(无A[2])
…
令A[i]=1。
# -*- coding:utf-8 -*-
class Solution:
def multiply(self, A):
B = []
for i in range(len(A)):
temp = A[i]
A[i] = 1
b= 1
for j in range(len(A)):
b*=A[j]
B.append(b)
A[i] = temp
return B
方法二:
不将A[i]置1,考虑A[i]两边,看作两个部分,分别求乘积,最终将这两部分相乘就是最后的结果了。
# -*- coding:utf-8 -*-
class Solution:
def multiply(self, A):
# write code here
n = len(A)
B = [1]*n
for i in range(1,n):
B[i] = B[i-1] * A[i-1]
temp = 1
for j in range(n-2, -1, -1):
temp *= A[j+1]
B[j] *= temp
return B