mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
27 lines
689 B
HTML
27 lines
689 B
HTML
<p>Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.</p>
|
|
|
|
<p>Since the result may be very large, so you need to return a string instead of an integer.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [10,2]
|
|
<strong>Output:</strong> "210"
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,30,34,5,9]
|
|
<strong>Output:</strong> "9534330"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 100</code></li>
|
|
<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|