| 1 | class Solution { |
| 2 | public String largestNumber(int[] nums) { |
| 3 | int n = nums.length; |
| 4 | String elements[] = new String[n]; |
| 5 | for(int i=0;i<n;i++){ //N |
| 6 | elements[i] = Integer.toString(nums[i]); |
| 7 | } |
| 8 | // KNlogN |
| 9 | Arrays.sort(elements, new Comparator<String>(){ |
| 10 | public int compare(String a, String b){ |
| 11 | String first = a + b; |
| 12 | String sec = b + a; |
| 13 | return sec.compareTo(first); //K |
| 14 | } |
| 15 | }); |
| 16 | if(elements[0].equals("0")){ |
| 17 | return "0"; |
| 18 | } |
| 19 | // N |
| 20 | StringBuilder sb = new StringBuilder(); |
| 21 | for(String val : elements){ |
| 22 | sb.append(val); |
| 23 | } |
| 24 | return sb.toString(); |
| 25 | } |
| 26 | } |