【LEETCODE】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

class Solution {
public:
    int maxProduct(int A[], int n) {
        int b=1, f=1, res=INT_MIN;
        for(int i=0; i<n; i++){
            res=max(res, max(b*=A[i],f*=A[n-1-i]));
            if(b==0) b=1; if(f==0) f=1;
        }
        return res;
    }
};

别人的简单的答案～～。。。自己的就不意思贴了。。自愧不如