codewars #45 Sort - one, three, two (5kyu)

 #45 Sort - one, three, two

Hey You !

Sort these integers for me ...

By name ...

Do it now !

Input

Range is 0-999

There may be duplicates

The array may be empty

?

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

import java.util.Arrays; import java.util.Comparator;   public class Dinglemouse {       private static final String[] tens = { "", "ten", "twenty", "thirty", "forty", "fifty", "sixty", "seventy",             "eighty", "ninety" };       private static final String[] nums = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",             "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen",             "nineteen" };       public static String convert(int n) {         if (n == 0)             return "zero";         String result;         if (n % 100 < 20) {             result = nums[n % 100];             n /= 100;         } else {             result = nums[n % 10];             n /= 10;             result = tens[n % 10] + result;             n /= 10;         }         if (n == 0)             return result;         return nums[n] + " hundred" + result;     }       public static int[] sort(final int array[]) {         return Arrays.stream(array).boxed()                .sorted(Comparator.comparing(Dinglemouse::convert)).map(String::valueOf)                .mapToInt(Integer::valueOf).toArray();     } }