blob: 13c69803b87aa2be298177649faf63010cc94e12 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
int maxOperations(vector<int> &nums, int k) {
unordered_map<int, int> freq;
int ans = 0;
for (int i = 0; i < nums.size(); i++)
if (freq[k - nums[i]] > 0) {
ans++;
freq[k - nums[i]]--;
} else
freq[nums[i]]++;
return ans;
}
};
int main() {
vector<int> nums = {1, 2, 3, 4};
Solution obj;
cout << obj.maxOperations(nums, 5);
}
|