-
Notifications
You must be signed in to change notification settings - Fork 0
/
product_of_array_except_self.java
55 lines (34 loc) · 1.27 KB
/
product_of_array_except_self.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
Given an integer array nums, return an array answer such that
answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in O(n) time and without using the division operation.
Example 1:
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Example 2:
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
Constraints:
2 <= nums.length <= 105
-30 <= nums[i] <= 30
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
Follow up: Can you solve the problem in O(1) extra space complexity?
(The output array does not count as extra space for space complexity analysis.)
*/
class ProductOfArrayExceptSelf {
public int[] productExceptSelf(int[] nums) {
int oldProduct = 1;
int[] outputArray = new int[nums.length];
for(int i = 0; i < nums.length; i++){
outputArray[i] = oldProduct;
oldProduct *= nums[i];
}
oldProduct = 1;
for(int i = nums.length -1; i >= 0; i--){
outputArray[i] *= oldProduct;
oldProduct *= nums[i];
}
return outputArray;
}
}