From dacd87b009f8a106172c4e07853bdf2b3aaf664f Mon Sep 17 00:00:00 2001
From: jinbudaily <18336218010@163.com>
Date: Mon, 24 Jul 2023 15:05:52 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200051.N=E7=9A=87=E5=90=8EII?=
 =?UTF-8?q?=20=E6=8E=92=E7=89=88=E6=A0=BC=E5=BC=8F=E4=BF=AE=E5=A4=8D?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0052.N皇后II.md | 17 ++++++++---------
 1 file changed, 8 insertions(+), 9 deletions(-)

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