liulingwuling的博客

#include <iostream>#include <map>#include <vector>#include <algorithm>#include <queue>using namespace std;int main(){ int R,C; while(cin>>R>>C){ queue<pair<int,int> > bfs;

//DFS (Time Limited)class Solution {public: int dfs(vector<vector<int>> &matrix,int i,int j,int R,int C,bool** visited){ int res=R+C; if (0==matrix[i][j]) return 0; visited[

递归（Time Limited），便于理解class Solution {public: bool isMatch(string s, string p) { if (p.empty()) return s.empty();//同空为真 if (p[0]!='*'){ if (s[0]==p[0]||(p[0]=='?'&&!s.em

class Solution {public: bool isMatch(string s, string p) { int lens=s.size(),lenp=p.size(),i,j; if (p.empty()) return s.empty();//wise!!!! if (p[1]!='*'){ //第一种

动态规划 dp[i]=true为i之前的子串能被分割为字典当中的词class Solution {public: bool wordBreak(string s, vector<string>& wordDict) {//dynamic programming unordered_map<string,int> dict; if (wordDict.siz

这里写代码片#include <iostream>using std::namespacevoid func(int &p){p=2;}int main(){int a;func(a);cout<<"a="<<a<<endl;}

单向链表逆序O(n)复杂度