mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 06:22:54 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给你一个整数数组 <code>nums</code>,将它重新排列成 <code>nums[0] < nums[1] > nums[2] < nums[3]...</code> 的顺序。</p>\n\n<p>你可以假设所有输入数组都可以得到满足题目要求的结果。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [1,5,1,1,6,4]\n<strong>输出:</strong>[1,6,1,5,1,4]\n<strong>解释:</strong>[1,4,1,5,1,6] 同样是符合题目要求的结果,可以被判题程序接受。\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [1,3,2,2,3,1]\n<strong>输出:</strong>[2,3,1,3,1,2]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>0 <= nums[i] <= 5000</code></li>\n\t<li>题目数据保证,对于给定的输入 <code>nums</code> ,总能产生满足题目要求的结果</li>\n</ul>\n\n<p> </p>\n\n<p><strong>进阶:</strong>你能用 O(n) 时间复杂度和 / 或原地 O(1) 额外空间来实现吗?</p>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 331,
|
||||
"likes": 343,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Sort Colors\", \"titleSlug\": \"sort-colors\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u989c\\u8272\\u5206\\u7c7b\"}, {\"title\": \"Kth Largest Element in an Array\", \"titleSlug\": \"kth-largest-element-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6570\\u7ec4\\u4e2d\\u7684\\u7b2cK\\u4e2a\\u6700\\u5927\\u5143\\u7d20\"}, {\"title\": \"Wiggle Sort\", \"titleSlug\": \"wiggle-sort\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6446\\u52a8\\u6392\\u5e8f\"}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"81.7K\", \"totalAcceptedRaw\": 31317, \"totalSubmissionRaw\": 81741, \"acRate\": \"38.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"84.6K\", \"totalAcceptedRaw\": 32549, \"totalSubmissionRaw\": 84580, \"acRate\": \"38.5%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user