feat: add cpp solution to lc problem: No.1679

No.1679.Max Number of K-Sum Pairs/README.md

Author: Dhoni77

solution/1600-1699/1679.Max Number of K-Sum Pairs/README.md

@@ -96,10 +96,29 @@ class Solution {
 }
 ```
 
-### **...**
-
-```
+### **C++**
 
+```cpp
+class Solution {
+ public:
+  int maxOperations(vector<int>& nums, int k) {
+    int n = nums.size();
+    sort(nums.begin(), nums.end());
+    int cnt = 0;
+    int i = 0, j = n - 1;
+    while (i < j) {
+      if (nums[i] + nums[j] == k) {
+        i++;
+        j--;
+        cnt++;
+      } else if (nums[i] + nums[j] > k) {
+        j--;
+      } else
+        i++;
+    }
+    return cnt;
+  }
+};
 ```
 
 <!-- tabs:end -->

solution/1600-1699/1679.Max Number of K-Sum Pairs/README_EN.md

@@ -86,10 +86,29 @@ class Solution {
 }
 ```
 
-### **...**
-
-```
+### **C++**
 
+```cpp
+class Solution {
+ public:
+  int maxOperations(vector<int>& nums, int k) {
+    int n = nums.size();
+    sort(nums.begin(), nums.end());
+    int cnt = 0;
+    int i = 0, j = n - 1;
+    while (i < j) {
+      if (nums[i] + nums[j] == k) {
+        i++;
+        j--;
+        cnt++;
+      } else if (nums[i] + nums[j] > k) {
+        j--;
+      } else
+        i++;
+    }
+    return cnt;
+  }
+};
 ```
 
 <!-- tabs:end -->

solution/1600-1699/1679.Max Number of K-Sum Pairs/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+ public:
+  int maxOperations(vector<int>& nums, int k) {
+    int n = nums.size();
+    sort(nums.begin(), nums.end());
+    int cnt = 0;
+    int i = 0, j = n - 1;
+    while (i < j) {
+      if (nums[i] + nums[j] == k) {
+        i++;
+        j--;
+        cnt++;
+      } else if (nums[i] + nums[j] > k) {
+        j--;
+      } else
+        i++;
+    }
+    return cnt;
+  }
+};