Given an array of n integers where n > 1, nums
, return an array output
such that output[i]
is equal to the product of all the elements of nums
except nums[i]
.
Solve it without division and in O(n).
For example, given [1,2,3,4]
, return [24,12,8,6]
.
Follow up:
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)
Difficulty:Medium
注意0的情况
class Solution(object):
def productExceptSelf(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
maxans = 1
zeroNum = 0
ans = []
for i in nums:
if i==0:
zeroNum+=1
else:
maxans*=i
if zeroNum==0:
for i in nums:
ans.append(maxans/i)
elif zeroNum==1:
for i in nums:
if i==0:
ans.append(maxans)
else:
ans.append(0)
else:
for i in nums:
ans.append(0)
return ans