整理百度readme

Author: pandasLab

携程/include.h

@@ -0,0 +1,96 @@
+// C
+#ifndef _GLIBCXX_NO_ASSERT
+#include <cassert>
+#endif
+#include <cctype>
+#include <cerrno>
+#include <cfloat>
+#include <ciso646>
+#include <climits>
+#include <clocale>
+#include <cmath>
+#include <csetjmp>
+#include <csignal>
+#include <cstdarg>
+#include <cstddef>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <ctime>
+
+#if __cplusplus >= 201103L
+#include <ccomplex>
+#include <cfenv>
+#include <cinttypes>
+//#include <cstdalign>
+#include <cstdbool>
+#include <cstdint>
+#include <ctgmath>
+#include <cwchar>
+#include <cwctype>
+#endif
+
+// C++
+#include <algorithm>
+#include <bitset>
+#include <complex>
+#include <deque>
+#include <exception>
+#include <fstream>
+#include <functional>
+#include <iomanip>
+#include <ios>
+#include <iosfwd>
+#include <iostream>
+#include <istream>
+#include <iterator>
+#include <limits>
+#include <list>
+#include <locale>
+#include <map>
+#include <memory>
+#include <new>
+#include <numeric>
+#include <ostream>
+#include <queue>
+#include <set>
+#include <sstream>
+#include <stack>
+#include <stdexcept>
+#include <streambuf>
+#include <string>
+#include <typeinfo>
+#include <utility>
+#include <valarray>
+#include <vector>
+
+#if __cplusplus >= 201103L
+#include <array>
+#include <atomic>
+#include <chrono>
+#include <condition_variable>
+#include <forward_list>
+#include <future>
+#include <initializer_list>
+#include <mutex>
+#include <random>
+#include <ratio>
+#include <regex>
+#include <scoped_allocator>
+#include <system_error>
+#include <thread>
+#include <tuple>
+#include <typeindex>
+#include <type_traits>
+#include <unordered_map>
+#include <unordered_set>
+#endif
+
+
+//#include <bits/stdc++.h>
+
+// #define LL long long
+// #define INT_MAX 2147483647
+// #define INT_MIN (-INT_MAX - 1)
+
+

携程/tempCodeRunnerFile.cpp

@@ -0,0 +1 @@
+getPath

携程/工作路径

@@ -0,0 +1,76 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一维字符串组
+vector<string> getStrings(char c = ' '){
+    vector<string> result;
+    string str;
+    string tmpStr;
+    getline(cin, str);
+    if(str.size() == 0) return result;
+    for(int i = 0; i < str.size(); i++){
+        if(str[i] == c){
+            if(!tmpStr.empty()){
+                result.push_back(tmpStr);
+                tmpStr.clear();
+            }
+            continue;
+        }
+        tmpStr.push_back(str[i]);
+    }
+    result.push_back(tmpStr);
+    return result;
+}
+
+void getPath(vector<string> &inputs, int &k, string &tmpstr, set<char> &visited, bool &hasvis, vector<string> &result){
+    if(k == inputs.size()){
+        if(hasvis){
+            result.push_back(tmpstr+"--circular dependency");
+        }else{
+            result.push_back(tmpstr);
+        }
+        return;
+    }
+    string str = inputs[k];
+    for (int i = 0; i < str.size(); i++){
+        tmpstr.push_back(str[i]);
+        k++;
+        auto item = visited.find(str[i]);
+        if(item == visited.end()){
+            visited.insert(str[i]);
+        }else{
+            hasvis = true;
+        }
+        getPath(inputs, k, tmpstr,visited, hasvis, result);
+        if(item == visited.end()){
+            item = visited.find(str[i]);
+            visited.erase(item);
+        }else{
+            hasvis = false;
+        }
+        k--;
+        tmpstr.pop_back();
+    }
+}
+
+int main(int argc, char const *argv[])
+{
+    vector<string> inputs = getStrings();
+    vector<string> result;
+    int k = 0;
+    string tmpstr;
+    set<char> visited;
+    bool hasvis = false;
+    getPath(inputs, k, tmpstr, visited, hasvis, result);
+    for(auto str : result){
+        cout << str << endl;
+    }
+    return 0;
+}
+
+//a bc df gh
+//a bc d eag f
+
+
+

携程/工作路径.cpp

@@ -0,0 +1,14 @@
+**第一题:铺地毯**
+✅ 通过[代码链接](铺地毯.cpp)
+![](1.1.png)
+![](1.2.png)
+第二题:选角
+✅ 通过[代码链接](选角.cpp)
+![](2.1.png)
+![](2.2.png)
+![](2.3.png)
+**第三题:走台阶**
+❎  未通过[代码链接](选角.cpp)
+![](3.1.png)
+![](3.2.png)
+