题目:
Given an array nums
of n integers where n > 1, return an array output
such that output[i]
is equal to the product of all the elements of nums
except nums[i]
.
Example:
Input:[1,2,3,4]
Output:[24,12,8,6]
Note: Please solve it without division and in O(n).
Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)
思路
我们以一个4个元素的数组为例,nums=[a1, a2, a3, a4]。
想在O(n)时间复杂度完成最终的数组输出,res=[a2*a3*a4, a1*a3*a4, a1*a2*a4, a2*a3*a4]。
比较好的解决方法是构造两个数组相乘:
[1, a1, a1*a2, a1*a2*a3]
[a2*a3*a4, a3*a4, a4, 1]
这样思路是不是清楚了很多,而且这两个数组我们是比较好构造的。
AC代码如下:
public int[] productExceptSelf(int[] nums) {
int len = nums.length;
int[] pSeq = new int[nums.length];
int[] nSeq = new int[nums.length];
pSeq[0] = 1;
for (int i = 1; i < len; i ++) {
pSeq[i] = pSeq[i - 1] * nums[i - 1];
}
nSeq[len - 1] = 1;
for (int i = len - 2; i >= 0; i --) {
nSeq[i] = nSeq[i + 1] * nums[i + 1];
}
for (int i = 0; i < len; i ++) {
pSeq[i] *= nSeq[i];
}
return pSeq;
}
但是,上面的空间复杂度为O(N),不满足常数时间复杂度。我们可以对上面的代码进行空间优化,用一个常数tmp来保存每次计算的结果值。
优化AC代码:
public class ProductofArrayExceptSelf
{
public static void main(String[] args)
{
/**
* Example:
* Input: [1,2,3,4]
* Output: [24,12,8,6]
*/
int[] nums = { 1, 2, 3, 4 };
int[] output = productExceptSelf(nums);
LeetCodeUtil.printIntArray(output, output.length);
}
public static int[] productExceptSelf(int[] nums)
{
int res[] = new int[nums.length];
res[0] = 1;
int tmp = 1;
for (int i = 1; i < nums.length; i++)
{
tmp = tmp * nums[i - 1];
res[i] = tmp;
}
tmp = 1;
for (int i = nums.length - 2; i >= 0; i--)
{
tmp = tmp * nums[i + 1];
res[i] = res[i] * tmp;
}
return res;
}
}