Find the?kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

For example,
Given?[3,2,1,5,6,4]?and k = 2, return 5.

Note:?
You may assume k is always valid, 1 ≤ k ≤ array's length.

public class Solution {public int findKthLargest(int[] nums, int k) {//先排序，然后返回第k個(gè)值（從小到大排序） Arrays.sort(nums);return nums[nums.length-k];} }

?

轉(zhuǎn)載于:https://www.cnblogs.com/qiaomu/p/4709162.html

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的[leedcode 215] Kth Largest Element in an Array的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。