update

leetcode-cn/originData/beautiful-arrangement.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>假设有从 1 到 n 的 n 个整数。用这些整数构造一个数组 <code>perm</code>（<strong>下标从 1 开始</strong>），只要满足下述条件 <strong>之一</strong> ，该数组就是一个 <strong>优美的排列</strong> ：</p>\n\n<ul>\n\t<li><code>perm[i]</code> 能够被 <code>i</code> 整除</li>\n\t<li><code>i</code> 能够被 <code>perm[i]</code> 整除</li>\n</ul>\n\n<p>给你一个整数 <code>n</code> ，返回可以构造的 <strong>优美排列 </strong>的 <strong>数量</strong> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 2\n<strong>输出：</strong>2\n<b>解释：</b>\n第 1 个优美的排列是 [1,2]：\n    - perm[1] = 1 能被 i = 1 整除\n    - perm[2] = 2 能被 i = 2 整除\n第 2 个优美的排列是 [2,1]:\n    - perm[1] = 2 能被 i = 1 整除\n    - i = 2 能被 perm[2] = 1 整除\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;= 15</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 287,
+            "likes": 289,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Beautiful Arrangement II\", \"titleSlug\": \"beautiful-arrangement-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4f18\\u7f8e\\u7684\\u6392\\u5217 II\"}]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"50.7K\", \"totalAcceptedRaw\": 37153, \"totalSubmissionRaw\": 50739, \"acRate\": \"73.2%\"}",
+            "stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"50.8K\", \"totalAcceptedRaw\": 37223, \"totalSubmissionRaw\": 50817, \"acRate\": \"73.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,