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.)
res[i]首先存放i前的所有数据的积,res[]最后一位刚好是所有数据不算最后一位的乘积。。。第二次循环需要使res[i]乘上i后面的数据。
public int[] productExceptSelf(int[] nums) {
int[] res=new int[nums.length];
res[0]=1;
for(int i=1;i<nums.length;i++){
res[i]=res[i-1]*nums[i-1];
}
int right=1;
for(int i=nums.length-1;i>=0;i--){
res[i]*=right;
right*=nums[i];
}
return res;
}