51.N皇后
看起来和数独差不多,结果我给做烂了,搞半天for循环一直有问题。放弃(而且我都想好对角线数组怎么表示了)😓。
这题用4个数组,2个函数都不够了。把我的代码改成基本和答案思路一样,结果我的代码都运行不了。他👵🏻的细节好多啊。看了答案也不会。
int solutionsSize;
char** generateBoard(int* queens, int n) {
char** board = (char**)malloc(sizeof(char*) * n);
for (int i = 0; i < n; i++) {
board[i] = (char*)malloc(sizeof(char) * (n+1));
这里不用n+1就会报错,不懂。
for (int j = 0; j < n; j++) board[i][j] = '.';
board[i][queens[i]] = 'Q',board[i][n]=0;
}
return board;
}
void backtrack(char*** solutions, int* queens, int n, int row, int* columns, int* diagonals1, int* diagonals2) {
if (row == n) {
char** board = generateBoard(queens, n);
solutions[solutionsSize++] = board;
} else {
for (int i = 0; i < n; i++) {
if (columns[i]) {
continue;
}
if(diagonals1[ row - i + n - 1]){
continue;
}
int diagonal1 = row - i + n - 1;
if(diagonals2[row + i]){
continue;
}
这里3个if语句我换成一个if语句也报错。
int diagonal2 = row + i;
queens[row] = i;
columns[i] = true;
diagonals1[diagonal1] = true;
diagonals2[diagonal2] = true;
backtrack(solutions, queens, n, row + 1, columns, diagonals1, diagonals2);
queens[row] = -1;
columns[i] = false;
diagonals1[diagonal1] = false;
diagonals2[diagonal2] = false;
}
}
}
char*** solveNQueens(int n, int* returnSize, int** returnColumnSizes) {
char*** solutions = malloc(sizeof(char**) * 501);
solutionsSize = 0;
int queens[n];
int columns[n];
int diagonals1[2*n];
int diagonals2[2*n];
memset(queens, -1, sizeof(queens));
memset(columns, 0, sizeof(columns));
memset(diagonals1, 0, sizeof(diagonals1));
memset(diagonals2, 0, sizeof(diagonals2));
backtrack(solutions, queens, n, 0, columns, diagonals1, diagonals2);
*returnSize = solutionsSize;
*returnColumnSizes = malloc(sizeof(int*) * solutionsSize);
for (int i = 0; i <*returnSize; i++) {
(*returnColumnSizes)[i] = n;
}
如果没给*returnSize,**returnColumnSizes赋值也报错。
return solutions;
}
暂时先不写回溯了。。
455.分发饼干
不会,思路是先把孩子,饼干排序,把小饼干给小孩子,喂饱一个算一个。或者说先把大饼干给大孩子。
还有审题,一个孩子只能有一个完整饼干,一个饼干不能切开。