码迷,mamicode.com
首页 > 其他好文 > 详细

[leedcode 215] Kth Largest Element in an Array

时间:2015-08-06 22:09:52      阅读:120      评论:0      收藏:0      [点我收藏+]

标签:

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个值(从小到大排序)
        Arrays.sort(nums);
        return nums[nums.length-k];
    }
}

 

[leedcode 215] Kth Largest Element in an Array

标签:

原文地址:http://www.cnblogs.com/qiaomu/p/4709162.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!