Maximum Product Subarray LeetCode solution in Java

1
class Solution {
2
  public int maxProduct(int[] nums) {
3
    int ans = Integer.MIN_VALUE;
4
    int m = 1;
5
    for (int i = 0; i < nums.length; i++) {
6
      m *= nums[i];
7
      ans = Math.max(m, ans);
8
      if (m == 0) m = 1;
9
    }
10
    int n = 1;
11
    for (int i = nums.length - 1; i >= 0; i--) {
12
      n *= nums[i];
13
      ans = Math.max(n, ans);
14
      if (n == 0) n = 1;
15
    }
16
    return ans;
17
  }
18
}