Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
26 lines (22 loc) · 634 Bytes

File metadata and controls

26 lines (22 loc) · 634 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
package com.lintcode;
import java.util.Arrays;
/**
* 5. 第k大元素 在数组中找到第k大的元素
*
* 样例
给出数组 [9,3,2,4,8],第三大的元素是 4
给出数组 [1,2,3,4,5],第一大的元素是 5,第二大的元素是 4,第三大的元素是 3,以此类推
*/
public class Solution5 {
/*
* @param k : description of k
* @param nums : array of nums
* @return: description of return
*/
public int kthLargestElement(int k, int[] nums) {
// write your code here
// write your code here
Arrays.sort(nums);
return nums[nums.length - k];
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.