add 小米

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)
+
+

大华/题目.md

@@ -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)
+
+

小米/1.1.png

@@ -0,0 +1 @@
+true

小米/1.2.png

@@ -0,0 +1,66 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一个字符串
+string getString(){
+    string result;
+    getline(cin, result);
+    return result;
+}
+
+
+bool find(vector<vector<char> >& board,vector<vector<bool> >& visited, string word, int i, int j, int k){
+    visited[i][j] = true;
+    if(k == word.length() - 1){
+        return true;
+    }
+    if(i+1 < board.size() && board[i+1][j] == word[k+1] && visited[i+1][j] == false){
+        if(find(board,visited,word,i+1,j,k+1)){
+            return true;
+        }
+    }
+    if(i-1 >= 0 && board[i-1][j] == word[k+1] && visited[i-1][j] == false){
+        if(find(board,visited,word,i-1,j,k+1)){
+            return true;
+        }
+    }
+    if(j+1 < board[0].size() && board[i][j+1] == word[k+1] && visited[i][j+1] == false){
+        if (find(board,visited,word,i,j+1,k+1)){
+            return true;
+        }
+    }
+    if(j-1 >= 0 && board[i][j-1] == word[k+1] && visited[i][j-1] == false){
+        if (find(board,visited,word,i,j-1,k+1)){
+            return true;
+        }
+    }
+    visited[i][j] = false;
+    return false;
+}
+
+bool exist(vector<vector<char> >& board, string word) {
+    vector<vector<bool> > visited(board.size(), vector<bool>(board[0].size(), false));
+    for(int i = 0; i < board.size(); ++i){
+        for(int j = 0; j < board[0].size(); ++j){
+            if(board[i][j] == word[0] && find(board, visited, word, i, j, 0)){
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+
+int main(int argc, char const *argv[])
+{
+    vector<vector<char> > input{{'A','B','C','E'},{'S','F','E','S'},{'A','D','E','E'}};
+    string str = getString();
+    bool result = exist(input, str);
+    if(result){
+        cout << "true";
+    }else{
+        cout << "false";
+    }
+    return 0;
+}

小米/2.1.png

@@ -0,0 +1,59 @@
+#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;
+}
+
+int checkPassword(string password){
+    // int result = 0;
+    bool hasxx = false;
+    bool hasdx = false;
+    bool hasnum = false;
+    bool hasfh = false;
+    if(password.size() < 8 || password.size() > 120){
+        return 1;
+    }
+    for(auto c : password){
+        if(c >= '0' && c <= '9'){
+            hasnum = true;
+        }else if(c >= 'a' && c <= 'z'){
+            hasxx = true;
+        }else if(c >= 'A' && c <= 'Z'){
+            hasdx = true;
+        }else if(c >= 32 && c <= 126){
+            hasfh = true;
+        }
+    }
+    if(hasfh && hasnum && hasxx && hasdx){
+        return 0;
+    }
+    return 2;
+}
+
+int main(int argc, char const *argv[])
+{
+    vector<string> inputs = getStrings();
+    for(auto input : inputs){
+        cout << checkPassword(input) << endl;
+    }
+    return 0;
+}

小米/2.2.png

@@ -0,0 +1,11 @@
+第一题:密码验证
+![](./1.1.png)
+![](./1.2.png)
+第二题:单词搜索
+![](./2.1.png)
+![](./2.2.png)
+二维矩阵是
+A B C E
+S F C S
+S D E E
+ps:不知道为啥第二题在leetcode剑指offer12原题，这个就有问题，只过了67%。