LeetCode-in-Scala.github.io

215. Kth Largest Element in an Array

Medium

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 the sorted order, not the kth distinct element.

Example 1:

Input: nums = [3,2,1,5,6,4], k = 2

Output: 5

Example 2:

Input: nums = [3,2,3,1,2,4,5,5,6], k = 4

Output: 4

Constraints:

Solution

import scala.util.Sorting

object Solution {
    def findKthLargest(nums: Array[Int], k: Int): Int = {
        val n = nums.length
        Sorting.quickSort(nums)
        nums(n - k)
    }
}