152

class Solution {public:    int maxProduct(vector<int> &nums) {        int size = nums.size();        vector<int> maxarr(size, 0);        vector<int> minarr(size, 0);        maxarr[0] = nums[0];        minarr[0] = nums[0];        for (int i = 1; i < size; i++) {            maxarr[i] = max(max(maxarr[i - 1] * nums[i], minarr[i - 1] * nums[i]), nums[i]);            minarr[i] = min(min(maxarr[i - 1] * nums[i], minarr[i - 1] * nums[i]), nums[i]);        }        return *max_element(maxarr.begin(), maxarr.end());    }};

int size = nums.size();vector<int> maxarr(size, 0);vector<int> minarr(size, 0);maxarr[0] = nums[0];minarr[0] = nums[0];int premax = nums[0];int premin = nums[0];int maxres = nums[0];for (int i = 1; i < size; i++) {    int t = premax;    premax = max(max(premax * nums[i], premin * nums[i]), nums[i]);    premin = min(min(t * nums[i], premin * nums[i]), nums[i]);    maxres = max(maxres, premax);}return maxres;