algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 0051.N皇后II 排版格式修复

Browse Source
This commit is contained in:
jinbudaily
2023-07-24 15:05:52 +08:00
parent f58a35db26
commit dacd87b009
1 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
problems/0052.N皇后II.md
View File

@ -43,13 +43,11 @@ n 皇后问题研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并
  ".Q.."]   ".Q.."]
] ]
# 思路 ## 思路
详看：[51.N皇后](https://mp.weixin.qq.com/s/lU_QwCMj6g60nh8m98GAWg) ，基本没有区别 详看：[51.N皇后](https://mp.weixin.qq.com/s/lU_QwCMj6g60nh8m98GAWg) ，基本没有区别
# C++代码
```CPP ```CPP
class Solution { class Solution {
private: private:
@ -100,8 +98,9 @@ public:
}; };
``` ```
# 其他语言补充 ## 其他语言补充
JavaScript ### JavaScript
```javascript ```javascript
var totalNQueens = function(n) { var totalNQueens = function(n) {
let count = 0; let count = 0;
@ -146,7 +145,7 @@ var totalNQueens = function(n) {
}; };
``` ```
TypeScript： ### TypeScript
```typescript ```typescript
// 0-该格为空，1-该格有皇后 // 0-该格为空，1-该格有皇后
@ -199,7 +198,7 @@ function checkValid(chess: GridStatus[][], i: number, j: number, n: number): boo
} }
``` ```
C ### C
```c ```c
//path[i]为在i行，path[i]列上存在皇后 //path[i]为在i行，path[i]列上存在皇后
@ -258,7 +257,8 @@ int totalNQueens(int n){
return answer; return answer;
} }
``` ```
Java ### Java
```java ```java
class Solution { class Solution {
int count = 0; int count = 0;
@ -310,4 +310,3 @@ class Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a> </a>