-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkLargestElement.java
55 lines (38 loc) · 1.02 KB
/
kLargestElement.java
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import java.util.*;
public class kLargestElement{
public static int findKthLargest(int[] nums, int k){
if(k<1 || nums == null)
return 0;
return getKth(nums.length - k + 1, nums, 0, nums.length - 1);
}
public static int getKth(int k, int[] nums, int start, int end){
int pivot = nums[end];
int left = start;
int right = end;
while(true){
while(nums[left] < pivot && left < right)
left++;
while(nums[right] >= pivot && right > left)
right--;
if(left == right)
break;
swap(nums, left, right);
}
swap(nums, left, end);
if(k == left + 1)
return pivot;
else if(k < left + 1)
return getKth(k ,nums, start, left - 1);
else
return getKth(k, nums, left + 1, end);
}
public static void swap(int[] arr, int n1, int n2){
int temp = arr[n1];
arr[n1] = arr[n2];
arr[n2] = temp;
}
public static void main(String[] args){
int[] a1 = {3,-1,1,0,2,4};
System.out.println("2nd largest element: " + String.valueOf(findKthLargest(a1, 2)) + " "+ Arrays.toString(a1));
}
}