题目:
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.)
题意:
给定n个整数的数组(n>1) nums,求数组output,其中output[i]是nums中除nums[i]以外的其他所有元素的乘积。
要求不能用除法,除output以外,只能使用有限个空间,时间复杂度为O(n)
代码:
class Solution(object):
def productExceptSelf(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
n = len(nums)
if n > 1 :
res = [1]*n #记录每个元素所有左边元素的乘积
for i in range(1,n) :
res[i] = res[i-1]*nums[i-1]
temp = nums[n-1] #记录元素i的所有右边元素的乘积
for i in range(n-2,-1,-1) :
res[i] = res[i]*temp #output中第i个元素即为nums中i左边所有元素的乘积,与i右边所有元素的乘积的乘积
temp = temp*nums[i]
return res
笔记:
由衷表示算法很精妙,算法参考的是:http://blog.csdn.net/sunao2002002/article/details/47089053