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.)
给定一个数组,返回每个index下元素等于除了自己后其它位置上元素的乘积.不能使用除法,时间复杂度为O(n).
提高:空间复杂度为常数,不包括输出的数组!
思路一:遍历数组后乘积然后再遍历一次除以每个index上的值.错误!首先不能使用除法,其次如果数组中存在0,结果会导致整个数组中的元素均为0;
思路二:嵌套循环.结果正确,但是 time limited exception. 时间复杂度为Θ(n^2).
思路三:正向遍历和反向遍历;
分析过程如上图:代码如下
class Solution {
public int[] productExceptSelf(int[] nums) {
int[] arr = new int[nums.length];
int temp = 1;
for(int i = 0; i < nums.length;i++){
temp*=nums[i];
arr[i] = temp;
}
temp = 1;
for(int i = nums.length-1;i>=0;i--){
if(i>=1)
arr[i] = temp*arr[i-1];
else
arr[i] = temp;
temp*=nums[i];
}
return arr;
}
}