描述
给定一个整数数组A。
定义
B
[
i
]
=
A
[
0
]
∗
.
.
.
∗
A
[
i
−
1
]
∗
A
[
i
+
1
]
∗
.
.
.
∗
A
[
n
−
1
]
,
B[i] = A[0]*...*A[i-1]*A[i+1]*...*A[n-1],
B[i]=A[0]∗...∗A[i−1]∗A[i+1]∗...∗A[n−1],计算B的时候请不要使用除法。请输出B。
样例
样例 1:
输入:
A = [1,2,3]
输出:
[6,3,2]
样例 2:
输入:
A = [2,4,6]
输出:
[24,12,8]
分两次循环
第一次记录数组从后往前的累积结果,f[i]代表i位后所有元素的乘积
第二次循环,从左往右,跳过i左侧累乘,右侧直接乘以f[i+1]
class Solution:
"""
@param: nums: Given an integers array A
@return: A long long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
"""
def productExcludeItself(self, A):
# write your code here
l = len(A)
B = []
f = [0 for i in range(l + 1)] # 生成一个元素全为0,长度为length的数组
f[l] = 1
for i in range(l-1,0,-1):
f[i] = f[i+1] * A[i]
tmp = 1
for i in range(l):
B.append(tmp * f[i+1])
tmp *= A[i]
return B