任务描述
思路
- 左边数字累积乘上右边数字累积
实现代码
class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:
lsum = rsum = 1
l = [1]
r = [1]
j = len(nums)-1
for i in range(0,len(nums)-1):
lsum *= nums[i]
l.append(lsum)
rsum *= nums[j-i]
r.append(rsum)
n = 0
ans = []
while n<len(nums):
ans.append(l[n]*r[j-n])
n += 1
return ans