mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一组非负整数 <code>nums</code>,重新排列每个数的顺序(每个数不可拆分)使之组成一个最大的整数。</p>\n\n<p><strong>注意:</strong>输出结果可能非常大,所以你需要返回一个字符串而不是整数。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入<code>:</code></strong><code>nums = [10,2]</code>\n<strong>输出:</strong><code>\"210\"</code></pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入<code>:</code></strong><code>nums = [3,30,34,5,9]</code>\n<strong>输出:</strong><code>\"9534330\"</code>\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 100</code></li>\n\t<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 896,
|
||||
"likes": 901,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"144.1K\", \"totalSubmission\": \"350.9K\", \"totalAcceptedRaw\": 144118, \"totalSubmissionRaw\": 350850, \"acRate\": \"41.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"144.5K\", \"totalSubmission\": \"351.8K\", \"totalAcceptedRaw\": 144531, \"totalSubmissionRaw\": 351782, \"acRate\": \"41.1%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user