FilesExpand file tree

 master

/

LargestNumber_179.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (37 loc) · 1.11 KB

 master

/

LargestNumber_179.java

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (37 loc) · 1.11 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

package String;

import java.util.Arrays;

/**

* 最大数

* 自定义排序规则

*

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

*/

public class LargestNumber_179 {

public String largestNumber(int[] nums) {

int n=nums.length;

String[] str=new String[n];

for(int i=0;i<n;i++){

str[i]=String.valueOf(nums[i]);

}

Arrays.sort(str,(a,b)->{

String s1=a+b;

String s2=b+a;

return s2.compareTo(s1);

});

StringBuilder sb=new StringBuilder();

for(String s:str){

sb.append(s);

}

//需要处理前导零的问题

int len=sb.length();

int k=0;

//去除前导零，如果结果就是零，会保留一位

while(k<len-1&&sb.charAt(k)=='0') k++;

return sb.substring(k);

}

public static void main(String[] args) {

LargestNumber_179 test = new LargestNumber_179();

String s = test.largestNumber(new int[]{3, 30, 34, 5, 9});

System.out.println(s);

}

}