feat: update README.md

solution/0000-0099/0067.Add Binary/README.md

@@ -70,6 +70,36 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string addBinary(string a, string b) {
+        string res;
+        int carry = 0;
+
+        int i = a.size() - 1;
+        int j = b.size() - 1;
+
+        while (i >= 0 || j >= 0) {
+            int digitA = i >= 0 ? a.at(i--) - '0' : 0;
+            int digitB = j >= 0 ? b.at(j--) - '0' : 0;
+            int sum = digitA + digitB + carry;
+            carry = sum >= 2 ? 1 : 0;
+            sum = sum >= 2 ? sum - 2 : sum;
+            res += to_string(sum);
+        }
+
+        if (carry == 1) res.push_back('1');
+        reverse(res.begin(), res.end());
+        return res;
+    }
+};
+```
+
+
+
 ### **C#**
 
 ```cs

solution/0000-0099/0067.Add Binary/README_EN.md

@@ -55,6 +55,35 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string addBinary(string a, string b) {
+        string res;
+        int carry = 0;
+
+        int i = a.size() - 1;
+        int j = b.size() - 1;
+
+        while (i >= 0 || j >= 0) {
+            int digitA = i >= 0 ? a.at(i--) - '0' : 0;
+            int digitB = j >= 0 ? b.at(j--) - '0' : 0;
+            int sum = digitA + digitB + carry;
+            carry = sum >= 2 ? 1 : 0;
+            sum = sum >= 2 ? sum - 2 : sum;
+            res += to_string(sum);
+        }
+
+        if (carry == 1) res.push_back('1');
+        reverse(res.begin(), res.end());
+        return res;
+    }
+};
+```
+
+
 ### **C#**
 
 ```cs

solution/0000-0099/0067.Add Binary/Solution.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    string addBinary(string a, string b) {
+        string res;
+        int carry = 0;
+
+        int i = a.size() - 1;
+        int j = b.size() - 1;
+
+        while (i >= 0 || j >= 0) {
+            int digitA = i >= 0 ? a.at(i--) - '0' : 0;
+            int digitB = j >= 0 ? b.at(j--) - '0' : 0;
+            int sum = digitA + digitB + carry;
+            carry = sum >= 2 ? 1 : 0;
+            sum = sum >= 2 ? sum - 2 : sum;
+            res += to_string(sum);
+        }
+
+        if (carry == 1) res.push_back('1');
+        reverse(res.begin(), res.end());
+        return res;
+    }
+};

solution/0300-0399/0338.Counting Bits/README.md

@@ -49,6 +49,22 @@
 
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> countBits(int n) {
+        vector<int> res(n + 1);
+        for (int i = 1; i <= n; i++) {
+            res[i] = res[i & (i - 1)] + 1;
+        }
+
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0338.Counting Bits/README_EN.md

@@ -65,6 +65,22 @@
 
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> countBits(int n) {
+        vector<int> res(n + 1);
+        for (int i = 1; i <= n; i++) {
+            res[i] = res[i & (i - 1)] + 1;
+        }
+
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0300-0399/0338.Counting Bits/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<int> countBits(int n) {
+        vector<int> res(n + 1);
+        for (int i = 1; i <= n; i++) {
+            res[i] = res[i & (i - 1)] + 1;
+        }
+
+        return res;
+    }
+};