46. 全排列
leetcode 46
class Solution {
public:
vector<vector<int>> ans;
bool isValid(vector<int>& res, int num) {
for(int& n : res) {
if(n == num) return false;
}
return true;
}
void dfs(vector<int>& nums, vector<int>& res){
if(res.size() == nums.size()){
ans.push_back(res);
return;
}
for(int i = 0; i < nums.size(); i++){
if(!isValid(res, nums[i])) continue;
res.push_back(nums[i]);
dfs(nums, res);
res.pop_back();
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<int> res;
dfs(nums, res);
return ans;
}
};
47. 全排列II
leetcode 47
class Solution {
public:
vector<vector<int>> ans;
void dfs(vector<int>& nums, vector<int>& res, vector<int>& visited) {
if(res.size() == nums.size()) {
ans.push_back(res);
return;
}
for(int i = 0; i < nums.size(); i++) {
if(visited[i]) continue;
res.push_back(nums[i]);
visited[i] = 1;
dfs(nums, res, visited);
res.pop_back();
visited[i] = 0;
while(i + 1 < nums.size() && nums[i] == nums[i+1]) i++;
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<int> res;
vector<int> visited(nums.size());
dfs(nums, res, visited);
return ans;
}
};
37. 解数独
leetcode 37
class Solution {
public:
bool isValid(const vector<vector<char>>& board, char ch, int i, int j) {
for(int k = 0; k < 9; k++) {
if(board[k][j] == ch) return false;
if(board[i][k] == ch) return false;
if(board[(i/3)*3 + k/3][(j/3)*3 + k%3] == ch) return false;
}
return true;
}
bool dfs(vector<vector<char>>& board, int i, int j) {
int n = 9;
if(j == 9) {
return dfs(board, i + 1, 0);
}
if(i == 9) {
return true;
}
if(board[i][j] != '.') {
return dfs(board, i, j + 1);
}
for(char ch = '1'; ch <= '9'; ch++) {
if(!isValid(board, ch, i, j)) continue;
board[i][j] = ch;
if(dfs(board, i, j + 1)) return true;
board[i][j] = '.';
}
return false;
}
void solveSudoku(vector<vector<char>>& board) {
dfs(board, 0, 0);
return;
}
};
51. N皇后
leetcode 51
class Solution {
public:
vector<vector<string>> ans;
bool isValid(vector<string>& map, int i, int j, int n) {
for(int k = 0; k < n; k++) {
if(map[i][k] == 'Q') return false;
if(map[k][j] == 'Q') return false;
if(k <= i && k <= j && map[i-k][j-k] == 'Q') return false;
if(k + i < n && k + j < n && map[i+k][j+k] == 'Q') return false;
if(k <= i && k + j < n && map[i-k][j+k] == 'Q') return false;
if(k + i < n && k <= j && map[i+k][j-k] == 'Q') return false;
}
return true;
}
void dfs(vector<string>& map, int i, int n) {
if(i == n) {
ans.push_back(map);
return;
}
for(int j = 0; j < n; j++) {
if(!isValid(map, i, j, n)) continue;
map[i][j] = 'Q';
dfs(map, i+1, n);
map[i][j] = '.';
}
return;
}
vector<vector<string>> solveNQueens(int n) {
vector<string> map(n);
string init(n, '.');
for(int i = 0; i < n; i++) map[i] = init;
dfs(map, 0, n);
return ans;
}
};