Find the Kth Largest Integer in the Array LeetCode solution in Java

1
class Solution {
2
  public String kthLargestNumber(String[] nums, int k) {
3

4
    int n = nums.length;
5

6
    Arrays.sort(
7
        nums,
8
        (a, b) -> {
9
          if (a.length() > b.length()) return 1;
10
          else if (b.length() > a.length()) return -1;
11
          else {
12
            return isgreater(a, b);
13
          }
14
        });
15
    return nums[n - k];
16
  }
17

18
  public static int isgreater(String a, String b) {
19

20
    int n = a.length();
21

22
    for (int i = 0; i < n; i++) {
23
      int a1 = Integer.parseInt("" + a.charAt(i));
24
      int b1 = Integer.parseInt("" + b.charAt(i));
25
      if (a1 > b1) return 1;
26
      if (b1 > a1) return -1;
27
    }
28
    return 0;
29
  }
30
}