50. Product of Array Exclude Itself
Description
Given an integers array A.
Define B[i] = A[0] * … * A[i-1] * A[i+1] * … * A[n-1], calculate B WITHOUT divide operation.Out put B
Example
For A = [1, 2, 3], return [6, 3, 2].
我的代码
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, nums):
# write your code here
count0 = 0
mul = 1
res = []
if nums == []:
return []
for i in nums:
if i == 0:
count0 += 1
if count0 == 2:
return [0 for i in nums]
else:
mul *= i
if count0 == 1:
for i in nums:
if i == 0:
res.append(mul)
else:
res.append(0)
else:
for i in nums:
res.append(int(mul/i))
return res
别人的代码
Leetcode中不能用除法,我没想到做法,参考了discussion中,觉得非常巧妙
class Solution:
# @param {integer[]} nums
# @return {integer[]}
def productExceptSelf(self, nums):
p = 1
n = len(nums)
output = []
for i in range(0,n):
output.append(p)
p = p * nums[i]
p = 1
for i in range(n-1,-1,-1):
output[i] = output[i] * p
p = p * nums[i]
return output
思路:
- 时间复杂度: O(n)
Leetcode中不能用除法。我一时间没想到解决方法。看到discussion中的做法恍然大悟,实际上是感觉是把数组以当前位置为界,分成了两个部分。用output先存储着当前位置之前的积,然后用p来累乘,得到后面的部分的积。
其实和我之前的思路相似,只需要更进一步就好了。