Add C++ 21 22 solutions

jinshendan · jinshendan · commit ef64fdcab6a6 · 2023-02-14T11:20:16.000+01:00
diff --git a/Problems/.DS_Store b/Problems/.DS_Store
diff --git a/Problems/21-Minimum-Suffix-Flips/Minimum-Suffix-Flips.cpp b/Problems/21-Minimum-Suffix-Flips/Minimum-Suffix-Flips.cpp
@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int minFlips(string target) {
+        int n = target.size();
+        int ans = 0;
+        for (int i = 0; i < n; i++)
+        {
+            if ((ans % 2 == 0 && target[i] != '0') || (ans % 2 == 1 && target[i] == '0')) ans++;
+        }
+        return ans;
+    }
+};
diff --git a/Problems/22-Merge-Strings-Alternately/Merge-Strings-Alternately.cpp b/Problems/22-Merge-Strings-Alternately/Merge-Strings-Alternately.cpp
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    string mergeAlternately(string word1, string word2) {
+        int n = word1.length();
+        int m = word2.length();
+        string s = "";
+        
+        int i = 0, j = 0;
+        while (i < n and j < m)
+        {
+            s += word1[i++];
+            s += word2[j++];
+        }
+        if (i == n)
+        {
+            while (j < m) s+= word2[j++];
+        }
+        if (j == m)
+        {
+            while (i < n) s+= word1[i++];
+        }
+        return s;
+    }
+};
diff --git a/README.md b/README.md
@@ -26,6 +26,9 @@ Solutions in various programming languages are provided. Enjoy it.
 18. 2023/02/09 [#605 Can Place Flowers](https://github.com/LeetcodeRush/Leetcode/tree/main/Problems/18-Can-Place-Flowers): Greedy
 19. 2023/02/10 [#763 Partition Labels](https://github.com/LeetcodeRush/Leetcode/tree/main/Problems/19-Partition-Labels): Greedy
 20. 2023/02/11 [#2405 Optimal Partition of String](https://github.com/LeetcodeRush/Leetcode/tree/main/Problems/20-Optimal-Partition-of-String): Greedy
+21. 2023/02/12 [#1529 Minimum Suffix Flips](): Greedy
+22. 2023/02/13 [#1768 Merge Strings Alternately](): String
+
 
 ## Weekly Contest
 
