Array类型的Medium题目。计算数组里除了自己的元素的乘积。不允许用到除法。我们想,对于某一个数字,如果我们知道其前面所有数字的乘积,同时也知道后面所有的数乘积,那么二者相乘就是我们要的结果。不需要用到两个数组来存放结果,用一个常数来存放一边的值。
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.)
public class Solution {
public int[] productExceptSelf(int[] nums) {
int n = nums.length;
int[] res=new int[n];
int right=1;
res[0]=1;
for(int i=1; i<n; i++){
res[i]=res[i-1]*nums[i-1];
}
for(int i=n-1; i>-1; i--){
res[i]*=right;
right*=nums[i];
}
return res;
}
}