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 ofnums
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.)
思路:如何想到的, 这题暴力解法就是o(n2)的解法,题目要求用O(N),就说明肯定要用高级算法,或者用空间先存储重复计算值,来省计算时间。
观察得到,每个位置的乘积 = 他左边所有数的乘积 × 他右边所有数的乘积;拆解为子问题,然而这两个子问题,很好解决,两边分别用两次扫描,乘积可以放到array里面。
class Solution {
public int[] productExceptSelf(int[] nums) {
int n = nums.length;
int[] left = new int[n];
left[0] = 1;
for(int i = 1; i < n; i++) {
left[i] = left[i - 1] * nums[i - 1];
}
int[] right = new int[n];
right[n - 1] = 1;
for(int i = n - 2; i >= 0; i--) {
right[i] = right[i + 1] * nums[i + 1];
}
int[] res = new int[n];
for(int i = 0; i < n; i++) {
res[i] = left[i] * right[i];
}
return res;
}
}
进一步优化,其实第二个array没必要,要保存的是一个前面乘积的中间值,用一个变量就可以了。
class Solution {
public int[] productExceptSelf(int[] nums) {
if(nums == null || nums.length == 0) {
return new int[0];
}
int n = nums.length;
int[] res = new int[n];
// calculate left;
res[0] = 1;
for(int i = 1; i < n; i++) {
res[i] = nums[i-1] * res[i-1];
}
// calculate right;
int right = 1;
for(int j = n -2; j >= 0; j--) {
right = right* nums[j+1];
res[j] = res[j] * right;
}
return res;
}
}