aboutsummaryrefslogtreecommitdiff
path: root/other/max_num_ksum_pair.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/max_num_ksum_pair.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_num_ksum_pair.cpp')
-rw-r--r--other/max_num_ksum_pair.cpp22
1 files changed, 22 insertions, 0 deletions
diff --git a/other/max_num_ksum_pair.cpp b/other/max_num_ksum_pair.cpp
new file mode 100644
index 0000000..13c6980
--- /dev/null
+++ b/other/max_num_ksum_pair.cpp
@@ -0,0 +1,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);
+}