8.17

Author: pandasLab

.vscode/settings.json

@@ -1,5 +1,12 @@
 {
     "files.associations": {
-        "vector": "cpp"
+        "vector": "cpp",
+        "iostream": "cpp",
+        "string": "cpp",
+        "ostream": "cpp",
+        "__split_buffer": "cpp",
+        "deque": "cpp",
+        "list": "cpp",
+        "iosfwd": "cpp"
     }
 }

README.md

@@ -2,10 +2,13 @@
 -------
 
 #### 文件说明
+模版文件夹下
 socution.cpp:模版（适用于牛客，赛码等）
 method.cpp:常用算法
 
 #### 作者
 author： 孟凡宇
 email:   [email protected]
-website: www.mengfanyu.com
+website: www.mengfanyu.com
+
+

leetcode/336_hui_wen_shu.cpp

@@ -0,0 +1,41 @@
+#include "include.h"
+
+class Solution {
+public:
+    vector<vector<int> > palindromePairs(vector<string>& words) {
+        vector<vector<int> > result;
+        for(int i = 0; i < words.size(); i++){
+            for(int j = 0; j < words.size(); j++){
+                if(j == i) continue;
+                if(canCompose(words, i, j)){
+                    result.push_back({i,j});
+                }
+            }
+        }
+        return result;
+    }
+    bool canCompose(vector<string>& words, int i, int j){
+        string word = words[i] + words[j];
+        cout << "compsing : " << i << "and" << j << "   ";
+        for(int k = 0; k < word.size() / 2; ++k){
+            if(word[k] != word[word.size() - k - 1]){
+                cout << "index "<< k <<"not compsed" <<endl;
+                return false;
+            }
+        }
+        cout <<endl;
+        return true;
+    }
+};
+
+int main(int argc, char const *argv[])
+{
+    vector<string> words{"abcd","dcba","lls","s","sssll"};
+    Solution *method = new Solution();
+    vector<vector<int> > result;
+    result = method->palindromePairs(words);
+    for(auto item : result){
+        cout << item[0] << "," << item[1] << endl;
+    }
+    return 0;
+}

leetcode/leetcode45.cpp

@@ -0,0 +1,64 @@
+#include "include.h"
+
+using namespace std;
+
+class Solution {
+public:
+    static bool cmp(string str1, string str2) {
+        // if(str1.size() == str2.size()) return str1 < str2;
+        int minsize = min(str1.size(), str2.size());
+        int maxsize = max(str1.size(), str2.size());
+        // cout << str1<<":"<<str2<<endl;
+        for(int i = 0;i < minsize;i++){
+            if(str1[i] != str2[i]){
+                return str1[i] < str2[i];
+            }
+        }
+        
+        if(maxsize == str1.size()){
+            for(int i = minsize;i < maxsize;i++){
+                if(str1[i] != str1[minsize - 1]){
+                    return str1[i] < str1[minsize - 1];
+                }
+            }
+        }
+        if(maxsize == str2.size()){
+            for(int i = minsize;i < maxsize;i++){
+                if(str2[i] != str2[minsize - 1]){
+                    // cout << str2[i] << str1[minsize - 1]<<endl;
+                    return str2[i] < str2[minsize - 1];
+                }
+            }
+        }
+        return false;
+    }
+
+    string minNumber(vector<int>& nums) {
+        // sort(nums.begin(), nums.end());
+        vector<string> strvec;
+        for(auto num : nums){
+            strvec.push_back(to_string(num));
+        }
+        sort(strvec.begin(),strvec.end(),cmp);
+        for(auto s : strvec){
+            cout << s<<" ";
+        }
+        string result;
+        for(auto str : strvec){
+            // cout << str;
+            result.append(str);
+        }
+        // cout << endl;
+        return result;
+    }
+};
+
+int main(int argc, char const *argv[])
+{
+    vector<int> input;
+    input.push_back(102);
+    input.push_back(10);
+    Solution *method = new Solution();
+    cout << method->minNumber(input);
+    return 0;
+}

leetcode/leetcode696.cpp

@@ -0,0 +1,40 @@
+#include "include.h"
+
+class Solution {
+public:
+    int countBinarySubstrings(string s) {
+        if(s.size() == 1) return 0;
+        int result = 0;
+        // int count0 = 0, count1 = 0;
+        int left0 = 0, left1 = 0, right0 = 1,right1 = 1;
+        for(int i = 1; i < s.size(); i++){
+            if(s[i] != s[i-1]){
+                result += min(right0 - left0, right1 - left1);
+                if(s[i] == '0'){
+                    left0 = i;
+                    right0 = i+1;
+                }
+                if(s[i] == '1'){
+                    left1 = i;
+                    right1 = i+1;
+                }
+            }else{
+                if(s[i] == '0'){
+                    right0 = i+1;
+                }
+                if(s[i] == '1'){
+                    right1 = i+1;
+                }
+            }
+        }
+        // result += min(right0 - left0, right1 - left1);
+        return result;
+    }
+};
+
+int main(int argc, char const *argv[])
+{
+    Solution *method = new Solution();
+    cout << method->countBinarySubstrings("00110");
+    return 0;
+}