238. Product of Array Except Self
- Total Accepted: 65971
- Total Submissions: 144366
- Difficulty: Medium
- Contributors: Admin
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(n)时间复杂度和O(1)空间复杂度
既然是除了自己,那么就以自己为分界线,分别求两边的乘积,然后乘一起,这就是除了自己的乘积
import java.util.*;
public class Solution {
public int[] productExceptSelf(int[] nums) {
int len = nums.length;
int re[] = new int [len];
Arrays.fill(re,1);
int mult = 1;
for(int i=1;i<len;i++){
mult *= nums[i-1];
re[i] *= mult;
}
mult = 1;
for(int i=len-2;i>=0;i--){
mult *= nums[i+1];
re[i] *= mult;
}
return re;
}
}