Add C++ 16 17 18 Solution

Author: jinshendan

Problems/.DS_Store

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int minimumSum(int num) {
+        vector<int> v {};
+        while(num){
+            v.push_back(num % 10);
+            num /= 10;
+        }
+
+        sort(v.begin(), v.end());
+        
+        vector<int> a(2, 0);
+        for (int i = 0; i < v.size(); i++)
+        {
+            a[i % 2] = a[i % 2] * 10 + v[i];
+        }
+        return a[0] + a[1];
+    }
+};

Problems/16-Minimum-Sum-of-Four-Digit-Number-After-Splitting-Digits/Minimum-Sum-of-Four-Digit-Number-After-Splitting-Digits.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int balancedStringSplit(string s) {
+        int ans = 0;
+        int cpt = 0;
+        for (auto& c: s)
+        {
+            if (c == 'R') cpt ++;
+            else cpt --;
+
+            if (cpt == 0) ans ++;
+        }
+        return ans;
+    }
+};

Problems/17-Split-a-String-in-Balanced-Strings/Split-a-String-in-Balanced-Strings.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    bool canPlaceFlowers(vector<int>& flowerbed, int n) {
+        
+        int m = flowerbed.size();
+        if (n == 0) return true;
+        int sum = 0;
+        for (int j = 0; j < m; j++)
+        {
+            if ((j==0 or flowerbed[j-1] == 0) and (j == m-1 or flowerbed[j+1] == 0) and flowerbed[j] == 0)
+            {
+                flowerbed[j] = 1;
+                sum++;
+            }
+        }
+        
+        return sum >= n;
+    }
+};