p215

发表于 | 分类于 |

LeetCode p215 Kth Largest Element in an Array 题解

1.题目：

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.

题意：

求一个数组中第k大的数。

2.解题思路:

使用类库实现的。

3.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
 
public class Solution {
    public int findKthLargest(int[] nums, int k) {
        return Arrays.stream(nums).sorted().skip(nums.length - k).findFirst()
				.getAsInt();
    }
}

4.一些总结：