largest-number

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.

Since the result may be very large, so you need to return a string instead of an integer.

&nbsp;
Example 1:

<pre>
Input: nums = [10,2]
Output: &quot;210&quot;
</pre>

Example 2:

<pre>
Input: nums = [3,30,34,5,9]
Output: &quot;9534330&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>

largestNumber

Largest Number

Smallest Value of the Rearranged Number

smallest-value-of-the-rearranged-number

重排数字的最小值

Find the Key of the Numbers

find-the-key-of-the-numbers

求出数字答案

Greedy

Array

String

Sorting

给定一组非负整数 <code>nums</code>，重新排列每个数的顺序（每个数不可拆分）使之组成一个最大的整数。

注意：输出结果可能非常大，所以你需要返回一个字符串而不是整数。

&nbsp;

示例 1：

<pre>
输入<code>：</code><code>nums = [10,2]</code>
输出：<code>"210"</code></pre>

示例&nbsp;2：

<pre>
输入<code>：</code><code>nums = [3,30,34,5,9]</code>
输出：<code>"9534330"</code>
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>