package question;

import java.util.Arrays;
import java.util.Comparator;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question179 {
 public static void main(String[] args) {
 System.out.println(new Question179().largestNumber(new int[]{
 0,9
 }));
 }
 public String largestNumber(int[] nums) {
 Long[] array=new Long[nums.length];
 for (int i = 0; i < nums.length; i++) {
 array[i]=(long)nums[i];
 }
 Arrays.sort(array, (o1, o2) -> {
 int l1=count(o1);
 int l2=count(o2);
 long t1=(o1*(long)Math.pow(10, l2)+o2);
 long t2=(o2*(long)Math.pow(10, l1)+o1);
 return Long.compare(t2, t1);
 });
 StringBuilder sb=new StringBuilder();
 for (Long a : array) {
 if ("0".equals(sb.toString())) break;
 sb.append(a);
 }
 return sb.toString();
 }

 private int count(long l) {
 if (l==0) return 1;
 int res=0;
 while (l>0) {
 l/=10;
 res++;
 }
 return res;
 }
}