FilesExpand file tree

 master

/

SortArrayForMinNumber.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (36 loc) · 1.04 KB

 master

/

SortArrayForMinNumber.java

Top

File metadata and controls

• Code
• Blame

42 lines (36 loc) · 1.04 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 _45;

import java.util.ArrayList;

import java.util.Comparator;

import java.util.List;

public class SortArrayForMinNumber {

/**

* 输入一个正整数数组，把数组里所有数字拼接起来排成一个数，使其为所有可能的拼接结果中最小的一个。

* 例如输入 {3,32,321}，则输出 321323。

*

* 使用自定义的排序规则对数组进行排序。

*/

public static String printMinNumber(int[] data) {

if (data == null || data.length == 0) {

return "";

}

List<Integer> list = new ArrayList<>();

for (int item : data) {

list.add(item);

}

list.sort(new Comparator<Integer>() {

@Override

public int compare(Integer o1, Integer o2) {

return (o1 + "" + o2).compareTo(o2 + "" + o1);

}

});

StringBuilder sb = new StringBuilder();

for (int item : list) {

sb.append(item);

}

return sb.toString();

}

public static void main(String[] args) {

int[] data = {3, 32, 321};

System.out.println(printMinNumber(data));

}

}