update

leetcode-cn/originData/beautiful-array.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>对于某些固定的&nbsp;<code>N</code>，如果数组&nbsp;<code>A</code>&nbsp;是整数&nbsp;<code>1, 2, ..., N</code>&nbsp;组成的排列，使得：</p>\n\n<p>对于每个&nbsp;<code>i &lt; j</code>，都<strong>不存在</strong>&nbsp;<code>k</code> 满足&nbsp;<code>i &lt; k &lt; j</code>&nbsp;使得&nbsp;<code>A[k] * 2 = A[i] + A[j]</code>。</p>\n\n<p>那么数组 <code>A</code>&nbsp;是漂亮数组。</p>\n\n<p>&nbsp;</p>\n\n<p>给定&nbsp;<code>N</code>，返回<strong>任意</strong>漂亮数组&nbsp;<code>A</code>（保证存在一个）。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>4\n<strong>输出：</strong>[2,1,4,3]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>5\n<strong>输出：</strong>[3,1,2,5,4]</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= N &lt;= 1000</code></li>\n</ul>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 170,
+            "likes": 172,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 10054, \"totalSubmissionRaw\": 15662, \"acRate\": \"64.2%\"}",
+            "stats": "{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 10283, \"totalSubmissionRaw\": 16018, \"acRate\": \"64.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,