20200829

Author: pandasLab

.vscode/settings.json

@@ -7,6 +7,7 @@
         "__split_buffer": "cpp",
         "deque": "cpp",
         "list": "cpp",
-        "iosfwd": "cpp"
+        "iosfwd": "cpp",
+        "algorithm": "cpp"
     }
 }

leetcode/dancisousuo79.cpp

@@ -0,0 +1,50 @@
+#include "include.h"
+
+using namespace std;
+
+bool dfs(vector<vector<char> >& board, string& word, int i,int j,int length){
+    if(i>=board.size()||j>=board[0].size()||i<0||j<0||length>=word.size()||word[length]!=board[i][j]){
+        return false;
+    }
+    if(length==word.size()-1&&word[length]==board[i][j]){
+        return true;
+    }
+    char temp=board[i][j];
+    board[i][j]='0';
+    bool flag=dfs(board,word,i,j+1,length+1)||dfs(board,word,i,j-1,length+1)||dfs(board,word,i+1,j,length+1)||dfs(board,word,i-1,j,length+1);
+    board[i][j]=temp;  // 标记过的点恢复原状，以便进行下一次搜索
+    return flag;
+}
+
+bool exist(vector<vector<char> >& board, string word) {
+    if(board.size() == 0) return false;
+    for (int i=0;i<board.size();i++){
+        for(int j=0;j<board[0].size();j++){
+            if (dfs(board,word,i,j,0)){
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+string getString(){
+    string result;
+    getline(cin, result);
+    return result;
+}
+
+int main(int argc, char const *argv[])
+{
+    vector<vector<char> > m{{'0','1','C','H','A'},{'9','E','7','B','I'},{'k','D','4','8','J'},{'6','5','F','G','O'},{'L','N','M','2','3'}};
+    string str;
+    while (getline(cin,str))
+    {
+        if(exist(m,str)){
+            cout << "Y"<<endl;
+        }else{
+            cout << "N"<<endl;
+        }
+    }
+    return 0;
+}

leetcode/include.h

@@ -0,0 +1,92 @@
+// 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>
+
+

leetcode/listtest

@@ -0,0 +1,13 @@
+#include "include.h"
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+    list<int> nums;
+    for(int i = 0; i < 7;i++){
+        nums.push_back(i);
+    }
+    
+    return 0;
+}

leetcode/listtest.cpp

@@ -0,0 +1,115 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一个数字
+template <typename T>
+T getNum(){
+    T result = 0;
+    string str;
+    bool isFushu = false;
+    getline(cin, str);
+    for(int i = 0; i < str.size(); ++i){
+        if(str[i] == '-'){
+            isFushu = true;
+            continue;
+        }
+        if(str[i]>='0' && str[i] <= '9'){
+            result = isFushu? result*10 - str[i] + '0' : result*10 + str[i] - '0';
+        }
+    }
+    return result;
+}
+//获取多个数字
+template <typename T>
+vector<T> getNums(char c = ' '){
+    vector<T> result;
+    string str;
+    T tmp = 0;
+    bool minus = false;
+    getline(cin, str);
+    if(str.size() == 0) return result;
+    for(int i = 0; i < str.size(); i++){
+        if(str[i] == c){
+            result.push_back(tmp);
+            tmp = 0;
+            minus = false;
+            continue;
+        }
+        if(str[i] == '-'){
+            minus = true;
+            continue;
+        }
+        tmp = minus? tmp*10 - str[i] + '0' : tmp*10 + str[i] - '0';
+    }
+    result.push_back(tmp);
+    return result;
+}
+//获取二维数组
+template <typename T>
+vector< vector<T> > getNums2(int n, char c = ' '){
+    vector< vector<T> > result;
+    vector<T > tmpResult;
+    while(n--){
+        tmpResult = getNums<T>(c);
+        if(tmpResult.size() == 0) break;
+        result.push_back(tmpResult);
+        tmpResult.clear();
+    }
+    return result;
+}
+
+void huisu(vector<vector<int> > &matrix,int target, int &sum, int &i, int &j,vector<int> &tmpres, vector<vector<int> > &result){
+    if(sum == target){
+        result.push_back(tmpres);
+        return ;
+    }else if(sum < target){
+        if(i-1 >= 0){
+            i--;
+            tmpres.push_back(matrix[i][j]);
+            sum+=matrix[i][j];
+            huisu(matrix, target, sum, i, j, tmpres, result);
+            sum-=matrix[i][j];
+            tmpres.pop_back();
+            i++;
+        }
+        if(j+1 <= matrix[0].size()-1){
+            j++;
+            tmpres.push_back(matrix[i][j]);
+            sum+=matrix[i][j];
+            huisu(matrix, target, sum, i, j, tmpres, result);
+            sum-=matrix[i][j];
+            tmpres.pop_back();
+            j--;
+        }
+    }else{
+        return ;
+    }
+
+}
+
+//输出二维vector
+template <typename T>
+void printVector2(vector<vector<T> > input){
+    for(int i = 0 ; i < input.size(); ++i){
+        for(int j = 0; j < input[i].size(); ++j){
+            cout << input[i][j] << "\t";
+        }
+        cout << endl;
+    }
+}
+
+int main(int argc, char const *argv[])
+{
+    //获取矩阵目标路径（没有对空矩阵判断）
+    int n = getNum<int>();//矩阵行数
+    vector<vector<int> > matrix = getNums2<int>(n);//矩阵
+    int target = getNum<int>();//目标值
+    int i = n-1,j = 0;
+    int sum = matrix[i][j];
+    vector<int> tmpvec{matrix[i][j]};
+    vector<vector<int> > result;//结果
+    huisu(matrix, target, sum, i, j, tmpvec, result);
+    printVector2(result);
+    return 0;
+}

leetcode/lujing

@@ -0,0 +1,43 @@
+#include "include.h"
+
+using namespace std;
+
+class A
+{
+private:
+    /* data */
+public:
+    A(/* args */);
+    ~A();
+};
+
+A::A(/* args */)
+{
+    cout << "create"<<endl;
+}
+
+A::~A()
+{
+    cout <<"delete" << endl;
+}
+
+
+int main(int argc, char const *argv[])
+{
+    int a[6][9][6];
+    for (size_t i = 0; i < 6; i++)
+    {
+        for (size_t j = 0; j < 9; j++)
+        {
+            for (size_t k = 0; k < 6; k++)
+            {
+                a[i][j][k] = i*54+j*6+k;
+            }
+            
+        }
+        
+    }
+    // cout << ***(a+736);
+    
+    return 0;
+}

leetcode/lujing.cpp

@@ -0,0 +1,29 @@
+#include "include.h"
+
+using namespace std;
+
+//获取一个数字
+template <typename T>
+T getNum(){
+    T result = 0;
+    string str;
+    bool isFushu = false;
+    getline(cin, str);
+    for(int i = 0; i < str.size(); ++i){
+        if(str[i] == '-'){
+            isFushu = true;
+            continue;
+        }
+        if(str[i]>='0' && str[i] <= '9'){
+            result = isFushu? result*10 - str[i] + '0' : result*10 + str[i] - '0';
+        }
+    }
+    return result;
+}
+
+int main(int argc, char const *argv[])
+{
+    int cont = getNum<int>();
+    
+    return 0;
+}

leetcode/pushvector

@@ -0,0 +1,33 @@
+#include "include.h"
+#include "bits/stdc++.h"
+
+using namespace std;
+
+int shuzi(int n){
+    vector<int> dp;
+    if(n == 0) return 0;
+    else dp.push_back(0);
+    int p2 = 0, p3 =0, p5 = 0;
+    while(--n >= 0){
+        int tmp = min(dp[p2] * 10 + 2, min(dp[p3]*10+3, dp[p5] * 10 + 5));
+        if(tmp == dp[p2] * 10 + 2){
+            dp.push_back(tmp);
+            p2++;
+        }else if(tmp == dp[p3] * 10 + 3){
+            dp.push_back(tmp);
+            p3++;
+        }else if(tmp == dp[p5] * 10 + 5){
+            dp.push_back(tmp);
+            p5++;
+        }
+    }
+    return dp[dp.size() - 1];
+}
+
+int main(int argc, char const *argv[])
+{
+    int n;
+    cin >> n;
+    cout << shuzi(n);
+    return 0;
+}