class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:
n=len(nums)
left=[1]*n
right=[1]*n
for i in range(1,n):
left[i]=left[i-1]*nums[i-1]
for i in range(n-2,-1,-1):
right[i]=right[i+1]*nums[i+1]
ansewer=[left[i]*right[i] for i in range(n)]
return ansewer
Leetcode-238.除自身以外数组的乘积(Python)
最新推荐文章于 2024-07-12 18:12:33 发布