Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int maxProduct(vector<int>& nums) {
- int n = nums.size();
- int imax = nums[0];
- int imin = imax;
- int ans = imax;
- for(int i=1;i<n;i++)
- {
- if(nums[i]<0){swap(imin, imax);}
- imax = max(imax*nums[i], nums[i]);
- imin = min(imin*nums[i], nums[i]);
- ans = max(imax, ans);
- }
- return ans;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement