update

leetcode-cn/originData/n-queens-ii.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p><strong>n&nbsp;皇后问题</strong> 研究的是如何将 <code>n</code>&nbsp;个皇后放置在 <code>n × n</code> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p>\n\n<p>给你一个整数 <code>n</code> ，返回 <strong>n 皇后问题</strong> 不同的解决方案的数量。</p>\n\n<p>&nbsp;</p>\n\n<div class=\"original__bRMd\">\n<div>\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/11/13/queens.jpg\" style=\"width: 600px; height: 268px;\" />\n<pre>\n<strong>输入：</strong>n = 4\n<strong>输出：</strong>2\n<strong>解释：</strong>如上图所示，4 皇后问题存在两个不同的解法。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 1\n<strong>输出：</strong>1\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 9</code></li>\n</ul>\n</div>\n</div>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 343,
+            "likes": 355,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"N-Queens\", \"titleSlug\": \"n-queens\", \"difficulty\": \"Hard\", \"translatedTitle\": \"N \\u7687\\u540e\"}]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"87.3K\", \"totalSubmission\": \"106.1K\", \"totalAcceptedRaw\": 87312, \"totalSubmissionRaw\": 106122, \"acRate\": \"82.3%\"}",
+            "stats": "{\"totalAccepted\": \"90K\", \"totalSubmission\": \"109.3K\", \"totalAcceptedRaw\": 89955, \"totalSubmissionRaw\": 109280, \"acRate\": \"82.3%\"}",
             "hints": [],
             "solution": null,
             "status": null,