Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example 1:


Input: [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.


Example 2:


Input: [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n     def maxProduct(self, nums):\n         """\n         :type nums: List[int]\n         :rtype: int\n         """\n         def prod(nums):\n             #function to calculate product\n             prod = 1\n             for i in nums:\n                 prod*=i\n             return prod\n         def listsplit(ls1,index):\n             result = []\n             st = -1\n             for i in index:\n                 if i == 0:\n                     st = i\n                 else:\n                     result.append(ls1[st+1:i])\n                     st = i\n             if st<len(ls1)-1:\n                 result.append(ls1[st+1:])\n             return result\n         \n         #main starts here\n         if not nums:\n             return 0\n         if len(nums) == 1:\n             return nums[0]\n         #find zeros: if zeros are included the result would be zeros only\n         result=[]\n         if 0 in nums:\n             zeros = [i for i in range(len(nums)) if nums[i] ==0]\n             sublist = listsplit(nums,zeros)\n             result.append(0)\n         else:\n             sublist = [nums]\n         #find negative numbers. consider even or odd\n         sublist = [i for i in sublist if i]\n         \n         for i in sublist:\n             if prod(i) <0:\n                 #there is negative number in the list\n                 negative = [j for j in range(len(i)) if i[j] < 0]\n                 left,right = negative[0],negative[-1]\n                 if len(i) == 1:\n                     result_t = i[0]\n                 elif left == 0 or right == len(i) -1:\n                     result_t = max(prod(i[left+1:]),prod(i[:right]))\n                 else:\n                     left_p,right_p = prod(i[:left]),prod(i[right+1:])\n                     if left_p <= right_p:\n                         result_t = prod(i[left+1:])\n                     else:\n                         result_t = prod(i[:right])\n             else:\n                 result_t = prod(i)\n             result.append(result_t)\n         return max(result)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxProduct'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6822