update

leetcode-cn/originData/sort-array-by-parity-ii.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个非负整数数组&nbsp;<code>nums</code>，&nbsp;&nbsp;<code>nums</code> 中一半整数是 <strong>奇数</strong> ，一半整数是 <strong>偶数</strong> 。</p>\n\n<p>对数组进行排序，以便当&nbsp;<code>nums[i]</code> 为奇数时，<code>i</code>&nbsp;也是 <strong>奇数</strong> ；当&nbsp;<code>nums[i]</code>&nbsp;为偶数时， <code>i</code> 也是 <strong>偶数</strong> 。</p>\n\n<p>你可以返回 <em>任何满足上述条件的数组作为答案</em> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [4,2,5,7]\n<strong>输出：</strong>[4,5,2,7]\n<strong>解释：</strong>[4,7,2,5]，[2,5,4,7]，[2,7,4,5] 也会被接受。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<b>输入：</b>nums = [2,3]\n<b>输出：</b>[2,3]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>2 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>\n\t<li><code>nums.length</code>&nbsp;是偶数</li>\n\t<li><code>nums</code>&nbsp;中一半是偶数</li>\n\t<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>\n</ul>\n\n<p>&nbsp;</p>\n\n<p><strong>进阶：</strong>可以不使用额外空间解决问题吗？</p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 233,
+            "likes": 235,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"95.2K\", \"totalSubmission\": \"133.4K\", \"totalAcceptedRaw\": 95162, \"totalSubmissionRaw\": 133384, \"acRate\": \"71.3%\"}",
+            "stats": "{\"totalAccepted\": \"95.3K\", \"totalSubmission\": \"133.5K\", \"totalAcceptedRaw\": 95258, \"totalSubmissionRaw\": 133521, \"acRate\": \"71.3%\"}",
             "hints": [],
             "solution": null,
             "status": null,