Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public class Solution {

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

}

O(nlogn) running time.

But for heap solution the worst case is O(nlogk), and if k is small enough, almost O(n). The average running time of modified quick sort is also close to O(n)

Thank you Tiejun!

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.