Problem:
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.)
Analysis:
题目大意:
给定长度为n的整数数组nums,其中n > 1,返回输出数组output,满足output[i]等于除nums[i]之外其余各数的乘积。
不使用除法,在O(n)时间复杂度内完成此题目。
例如,给定 [1,2,3,4],返回 [24,12,8,6]。
进一步思考:
你可以在常数空间复杂度内完成题目吗?(注意:输出数组不算在空间复杂度分析中)
解题思路:
]
维持两个数组, left[] and right[]. 分别记录 第i个元素 左边相乘的积left[i] and 右边相乘的积right[i]. 那么结果res[i]即为 left[i]*right[i].
follow up 要求O(1)空间. 利用返回的结果数组,先存right数组. 再从左边计算left,同时计算结果值, 这样可以不需要额外的空间.
Answer:
java代码:
public class Solution {
public int[] productExceptSelf(int[] nums) {
int[] res = new int[nums.length];
res[nums.length-1]=1;
for(int i=nums.length-2;i>=0;i--){
res[i]= res[i+1] * nums[i+1];
}
int left = 1;
for(int i=0;i<nums.length;i++){
res[i] = left * res[i];
left = left * nums[i];
}
return res;
}
}
python代码
class Solution(object):
def productExceptSelf(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
length = len(nums)
res=[1]*length
for i in range(1,length):
res[i] = res[i-1] * nums[i-1]
right=1
for i in range(0,length)[::-1]:
res[i] = res[i] * right
right=right*nums[i]
return res