题解 | #寻找第K大#
寻找第K大
https://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
import java.util.*; public class Solution { public int findKth(int[] a, int n, int K) { // write code here ArrayList<Integer> list = new ArrayList<>(); if (n == 0 || K == 0) { return -1; } for (int i : a) { list.add(i); } list.sort(Comparator.reverseOrder()); return list.get(K - 1); } }