15 ms  Java sort solution: faster than 98.21%
Order nums by string lengh then value in desc order, then return the (k - 1) value.\n\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k
Order nums by string lengh then value in desc order, then return the (k - 1) value.\n```\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        Arrays.sort(nums, (a, b) -> {\n            if (a.length() == b.length()) {\n                return b.compareTo(a);\n            } else {\n                return b.length() - a.length();\n            }\n        });\n        //e.g.[21, 12, 2, 1]\n        return nums[k - 1];\n    }\n}\n```
[]