class Solution { public: int maxProduct(int A[], int n) { int preNum1 = 1; //Remember all the Numbers int preNum2 = 1; //Remember all the Behind Numbers of first negative bool start2; int answers ; if(n == 0) return 0; if(n > 0) answers = A[0]; int negSum = 0; for(size_t i = 0; i != n;i++) { preNum1 *= A[i]; //cout<<"preNum1="<<preNum1<<endl; answers = (preNum1 > answers? preNum1:answers); if(start2 == true) { preNum2 *= A[i]; //cout<<"preNum2="<<preNum2<<endl; answers = (preNum2 > answers? preNum2:answers); } if(A[i] < 0) { negSum ++; } if(negSum == 1 && start2 == false) { start2 = true; preNum2 = 1; } if(A[i] == 0) { answers = (answers > 0) ? answers : 0; preNum1 = 1; preNum2 = 1; negSum = 0; start2 = false; } } return answers; } };