Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in sorted order, not the kth distinct element. For example, in [3, 2, 3, 1, 2, 4], the 1st largest is 4, the 2nd largest is 3, the 3rd largest is 3.
Solve this problem by sorting the array first, then returning the element at the correct position.
nums = [3, 2, 1, 5, 6, 4], k = 25nums = [3, 2, 3, 1, 2, 4, 5, 5, 6], k = 44nums = [1], k = 111 <= k <= nums.length <= 10^4-10^4 <= nums[i] <= 10^4Run your code to see results
Use Cmd+Enter to run