forked from kdn251/interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaximumProductSubarray.java
More file actions
34 lines (20 loc) · 888 Bytes
/
maximumProductSubarray.java
File metadata and controls
34 lines (20 loc) · 888 Bytes
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
// Find the contiguous subarray within an array (containing at least one number) which has the largest product.
// For example, given the array [2,3,-2,4],
// the contiguous subarray [2,3] has the largest product = 6.
public class Solution {
public int maxProduct(int[] nums) {
if(nums == null || nums.length == 0) return 0;
int result = nums[0];
int max = nums[0];
int min = nums[0];
for(int i = 1; i < nums.length; i++) {
int temp = max;
max = Math.max(Math.max(nums[i] * max, nums[i] * min), nums[i]);
min = Math.min(Math.min(nums[i] * temp, nums[i] * min), nums[i]);
if(max > result) {
result = max;
}
}
return result;
}
}