class Solution {
public:
unordered_map<string,map<string,int>> umap;
bool find(int ticknum,vector<string> & res)
{
if(res.size()==ticknum+1)
{
return true;
}
for (pair<const string, int>& target : umap[res[res.size() - 1]]) {
if (target.second > 0 ) { // 记录到达机场是否飞过了
res.push_back(target.first);
target.second--;
if (find(ticknum, res)) return true;
res.pop_back();
target.second++;
}
}
return false;
}
vector<string> findItinerary(vector<vector<string>>& tickets) {
vector<string> res;
for(int i=0;i<tickets.size();i++)
{
umap[tickets[i][0]][tickets[i][1]]++;
}
res.push_back("JFK");
find(tickets.size(),res);
return res;
}
};
class Solution {
public:
vector<vector<string>> res;
bool valid(int col,int row,vector<string>&path, int n)
{
for(int i=0;i<row;i++)
{
if(path[i][col]=='Q') return false;
}
for(int i=row-1,j=col-1;i>=0&&j>=0;i--,j--)
{
if(path[i][j]=='Q') return false;
}
for(int i=row-1,j=col+1;i>=0&&j<n;i--,j++)
{
if(path[i][j]=='Q') return false;
}
return true;
}
void queen(int n,int row,vector<string>&path)
{
if(row==n)
{
res.push_back(path);
return;
}
for(int col=0;col<n;col++)
{
if(valid(col,row,path,n))
{
path[row][col]='Q';
queen(n,row+1,path);
path[row][col]='.';
}
}
}
vector<vector<string>> solveNQueens(int n) {
vector<string>path(n,string(n,'.'));
queen(n,0,path);
return res;
}
};
class Solution {
public:
bool valid(int row,int col,int index,vector<vector<char>>& board)
{
for(int i=0;i<9;i++)
{
if(board[i][col]-'0'==index) return false;
if(board[row][i]-'0'==index) return false;
}
for(int i=(row/3)*3;i<(row/3)*3+3;i++)
{
for(int j=(col/3)*3;j<(col/3)*3+3;j++)
{
if(board[i][j]-'0'==index) return false;
}
}
return true;
}
bool sudoku(vector<vector<char>>& board)
{
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
if(board[i][j]=='.')
{
for(char k='1';k<='9';k++)
{
if(valid(i,j,k-'0',board))
{
board[i][j]=k;
if(sudoku(board)) return true;
board[i][j]='.';
}
}
return false;
}
}
}
return true;
}
void solveSudoku(vector<vector<char>>& board) {
sudoku(board);
}
};