01 2022 档案
摘要：class Solution { public: bool isMatch(string s, string p) { memset(dp,false,sizeof(dp)); int ns = s.size(),np = p.size(); bool flag; for(int i=1;i<ns;
阅读全文
摘要：class Solution { public: vector<vector<int>> combinationSum(vector<int>& candidates, int target) { sort(candidates.begin(),candidates.end()); vector<v
阅读全文
摘要：class Solution { public: void solveSudoku(vector<vector<char>>& board) { for(int i=0;i<9;i++){ for(int j=0;j<9;j++){ if(board[i][j]!='.'){ mt[0][i][bo
阅读全文
摘要：class Solution { public: int longestValidParentheses(string s) { int n = s.size(),i = 0,maxResult = 0,result = 0,t,tmax,tsum; if(n==0)return 0; stack<
阅读全文
摘要：class Solution { public: vector<int> findSubstring(string s, vector<string>& words) { vector<int>v; string t; int n = s.size(),n2 = words.size(),n3 =
阅读全文
