From 04237103b671f411d098613e5c923716223277f7 Mon Sep 17 00:00:00 2001
From: Eat-Swap <root@eatswap.org>
Date: Tue, 14 Jun 2022 16:27:10 +0800
Subject: [PATCH] add: 220607

---
 cpp/2206/220607.cpp     | 18 ++++++++++++++++++
 cpp/2206/CMakeLists.txt |  2 +-
 2 files changed, 19 insertions(+), 1 deletion(-)
 create mode 100644 cpp/2206/220607.cpp

diff --git a/cpp/2206/220607.cpp b/cpp/2206/220607.cpp
new file mode 100644
index 0000000..48345a8
--- /dev/null
+++ b/cpp/2206/220607.cpp
@@ -0,0 +1,18 @@
+#include <vector>
+#include <algorithm>
+
+/**
+ * 88. Merge Sorted Array
+ * You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
+ * Merge nums1 and nums2 into a single array sorted in non-decreasing order.
+ * The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
+ */
+
+class Solution {
+public:
+	static void merge(std::vector<int>& nums1, int m, const std::vector<int>& nums2, int n) {
+		for (int i = m; i < m + n; ++i)
+			nums1[i] = nums2[i - m];
+		std::stable_sort(nums1.begin(), nums1.end());
+	}
+};
diff --git a/cpp/2206/CMakeLists.txt b/cpp/2206/CMakeLists.txt
index fff3106..5947ba9 100644
--- a/cpp/2206/CMakeLists.txt
+++ b/cpp/2206/CMakeLists.txt
@@ -3,4 +3,4 @@ PROJECT(2206)
 
 SET(CMAKE_CXX_STANDARD 23)
 
-ADD_EXECUTABLE(2206 220610.cpp)
+ADD_EXECUTABLE(2206 220607.cpp)