LeetCode 152 - Maximum Product Subarray

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 int maxProduct(int[] nums) {
    int result = nums[0];
    int minHere = nums[0], maxHere = nums[0];
    for(int i=1; i<nums.length; i++) {
        int a = minHere * nums[i];
        int b = maxHere * nums[i];
        maxHere = Math.max(Math.max(a, b), nums[i]);
        minHere = Math.min(Math.min(a, b), nums[i]);
        result = Math.max(result, maxHere);
    }
    return result;
}