feat: add js solution to lc problem: No.0052 (#3232)

Author: rain84

solution/0000-0099/0052.N-Queens II/README.md

@@ -220,6 +220,34 @@ function totalNQueens(n: number): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function totalNQueens(n) {
+    const cols = Array(10).fill(false);
+    const dg = Array(20).fill(false);
+    const udg = Array(20).fill(false);
+    let ans = 0;
+    const dfs = i => {
+        if (i === n) {
+            ++ans;
+            return;
+        }
+        for (let j = 0; j < n; ++j) {
+            let [a, b] = [i + j, i - j + n];
+            if (cols[j] || dg[a] || udg[b]) {
+                continue;
+            }
+            cols[j] = dg[a] = udg[b] = true;
+            dfs(i + 1);
+            cols[j] = dg[a] = udg[b] = false;
+        }
+    };
+    dfs(0);
+    return ans;
+}
+```
+
 #### C#
 
 ```cs

solution/0000-0099/0052.N-Queens II/README_EN.md

@@ -214,6 +214,34 @@ function totalNQueens(n: number): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function totalNQueens(n) {
+    const cols = Array(10).fill(false);
+    const dg = Array(20).fill(false);
+    const udg = Array(20).fill(false);
+    let ans = 0;
+    const dfs = i => {
+        if (i === n) {
+            ++ans;
+            return;
+        }
+        for (let j = 0; j < n; ++j) {
+            let [a, b] = [i + j, i - j + n];
+            if (cols[j] || dg[a] || udg[b]) {
+                continue;
+            }
+            cols[j] = dg[a] = udg[b] = true;
+            dfs(i + 1);
+            cols[j] = dg[a] = udg[b] = false;
+        }
+    };
+    dfs(0);
+    return ans;
+}
+```
+
 #### C#
 
 ```cs

solution/0000-0099/0052.N-Queens II/Solution.js

@@ -0,0 +1,23 @@
+function totalNQueens(n) {
+    const cols = Array(10).fill(false);
+    const dg = Array(20).fill(false);
+    const udg = Array(20).fill(false);
+    let ans = 0;
+    const dfs = i => {
+        if (i === n) {
+            ++ans;
+            return;
+        }
+        for (let j = 0; j < n; ++j) {
+            let [a, b] = [i + j, i - j + n];
+            if (cols[j] || dg[a] || udg[b]) {
+                continue;
+            }
+            cols[j] = dg[a] = udg[b] = true;
+            dfs(i + 1);
+            cols[j] = dg[a] = udg[b] = false;
+        }
+    };
+    dfs(0);
+    return ans;
+}