feat: add solutions to lc/lcof2 problems: No. 008

lcof2/剑指 Offer II 002. 二进制加法/README.md

@@ -139,6 +139,34 @@ func addBinary(a string, b string) string {
 }
 ```
 
+### **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;
+    }
+};
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 002. 二进制加法/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;
+    }
+};

lcof2/剑指 Offer II 003. 前 n 个数字二进制中 1 的个数/README.md

@@ -103,6 +103,22 @@ func countBits(n int) []int {
 }
 ```
 
+### **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;
+    }
+};
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 003. 前 n 个数字二进制中 1 的个数/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;
+    }
+};

lcof2/剑指 Offer II 005. 单词长度的最大乘积/README.md

@@ -130,6 +130,40 @@ func max(a, b int) int {
 }
 ```
 
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxProduct(vector<string>& words) {
+        vector<vector<bool>> hash(words.size(), vector<bool>(26, false));
+        for (int i = 0; i < words.size(); i++)
+            for (char c: words[i])
+                hash[i][c - 'a'] = true;
+
+        int res = 0;
+        for (int i = 0; i < words.size(); i++) {
+            for (int j = i + 1; j < words.size(); j++) {
+                int k = 0;
+                for (; k < 26; k++) {
+                    if (hash[i][k] && hash[j][k])
+                        break;
+                }
+
+                if (k == 26) {
+                    int prod = words[i].size() * words[j].size();
+                    res = max(res, prod);
+                }
+            }
+        }
+
+        return res;
+    }
+};
+```
+
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 005. 单词长度的最大乘积/Solution.cpp

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    int maxProduct(vector<string>& words) {
+        vector<vector<bool>> hash(words.size(), vector<bool>(26, false));
+        for (int i = 0; i < words.size(); i++)
+            for (char c: words[i])
+                hash[i][c - 'a'] = true;
+
+        int res = 0;
+        for (int i = 0; i < words.size(); i++) {
+            for (int j = i + 1; j < words.size(); j++) {
+                int k = 0;
+                for (; k < 26; k++) {
+                    if (hash[i][k] && hash[j][k])
+                        break;
+                }
+
+                if (k == 26) {
+                    int prod = words[i].size() * words[j].size();
+                    res = max(res, prod);
+                }
+            }
+        }
+
+        return res;
+    }
+};

lcof2/剑指 Offer II 007. 数组中和为 0 的三个数/README.md

@@ -154,6 +154,42 @@ func threeSum(nums []int) [][]int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+        vector<vector<int>> res;
+
+        sort(nums.begin(), nums.end());
+        for (int k = 0; k < nums.size(); k++) {
+            int i = k + 1;
+            int j = nums.size() - 1;
+            if (k > 0 && nums[k] == nums[k - 1]) continue;
+
+            while(i < j) {
+                if (nums[i] + nums[j] + nums[k] == 0) {
+                    res.push_back(vector<int>{nums[k], nums[i], nums[j]});
+                    i++;
+                    j--;
+
+                    while(i < j && nums[i] == nums[i - 1]) i++;
+                    while(i < j && nums[j] == nums[j + 1]) j--;
+                } else if (nums[i] + nums[j] + nums[k] < 0) {
+                    i++;
+                } else {
+                    j--;
+                }
+            }
+        }
+
+        return res;
+    }
+};
+```
+
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 007. 数组中和为 0 的三个数/Solution.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+        vector<vector<int>> res;
+
+        sort(nums.begin(), nums.end());
+        for (int k = 0; k < nums.size(); k++) {
+            int i = k + 1;
+            int j = nums.size() - 1;
+            if (k > 0 && nums[k] == nums[k - 1]) continue;
+
+            while(i < j) {
+                if (nums[i] + nums[j] + nums[k] == 0) {
+                    res.push_back(vector<int>{nums[k], nums[i], nums[j]});
+                    i++;
+                    j--;
+
+                    while(i < j && nums[i] == nums[i - 1]) i++;
+                    while(i < j && nums[j] == nums[j + 1]) j--;
+                } else if (nums[i] + nums[j] + nums[k] < 0) {
+                    i++;
+                } else {
+                    j--;
+                }
+            }
+        }
+
+        return res;
+    }
+};

lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/README.md

@@ -136,6 +136,30 @@ func min(a, b int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0; 
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
+```
+
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/Solution.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0;
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};

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;
+    }
+};