So I have been looking for the solutions in discussion, and have been trying out many other solutions, like sort array and find kth index, quick select, selection sort and etc. Turns out sort the array and find the kth largest element has the best running time 81.92% versus quick select 25.86%.

Anyway, it's good to know more than less :)

BTW, Java code here ---

```
public int findKthLargest(int[] nums, int k) {
Arrays.sort(nums);
return nums[nums.length - k];
}
```