Coding-Problems/LeetCode/Solutions/LC1464.cpp at master · Mohammed-Shoaib/Coding-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
/*
Problem Statement: https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/
*/

class Solution {
public:
	int maxProduct(vector<int>& nums) {
		int m1, m2;
		m1 = m2 = 0;
		for (int& num: nums) {
			if (m1 < num)
				m2 = exchange(m1, num);
			else
				m2 = max(num, m2);
		}
		return (m1 - 1) * (m2 - 1);
	}
};