力扣215. 数组中的第K个最大元素 medium 20220128 题目描述: * 给定整数数组 nums 和整数 k,请返回数组中第 k 个最大的元素。 * 请注意,你需要找的是数组排序后的第 k 个最大的元素,而不是第 k 个不同的元素。 示例: * 输入: [3,2,1,5,6,4] 和 k = 2 * 输出: 5 思路1: * 使用快排将数组排序,然后从后开始找到第k个数即可
public static void quickSort(int[] arr,int start,int end){
//1.边界
if (arr==null||arr.length==0||start>=end) return;
//2.初始化
int left=start;
int right=end;
while (left<=right){
while (left<=right&&arr[left]<arr[start]){
left++;
}
while (left<=right&&arr[right]>arr[start]){
right--;
}
//开始交换两个
if (left<=right){
int temp=arr[right];
arr[right]=arr[left];
arr[left]=temp;
left++;
right--;
}
}
quickSort(arr,start,right);
quickSort(arr,left,end);
}
public static int findKthLargest(int[]arr,int k){
quickSort(arr,0, arr.length-1);
return arr[arr.length-k];
}
public static void main(String[] args) {
int[]array =new int[10];
for (int i = 0; i < array.length; i++) {
array[i]=(int)(Math.random()*100);
System.out.print(array[i]+",");
}
System.out.println();
quickSort(array,0,array.length-1);
for (int num:array){
System.out.print(num+",");
}
System.out.println();
System.out.println(findKthLargest(array,2));
}
88,94,59,72,42,31,62,81,26,21,
21,26,31,42,59,62,72,81,88,94,
88
方法二:
public int findKthLargest2(int[] arr,int k){
//1.边界
if (arr==null||arr.length==0 ||k<1||k>arr.length) return -1;
//2.查找第k大元素,arr.length-k表示右半段中第k大数的索引位置
return partition(arr,0,arr.length-1,arr.length-k);
}
public int partition(int[]arr,int start,int end,int k){
//1.边界
if (start>=end) return arr[k];
//2.初始化
int left=start;
int right=end;
int p=arr[start+(end-start)/2];
while (left<=right){
while (left<=right&&arr[left]<p){
left++;
}
while (left<=right&&arr[right]>p){
right--;
}
if (left<=right){
int temp=arr[right];
arr[right]=arr[left];
arr[left]=temp;
left++;
right--;
}
}
//第一趟遍历完成,大于p的在右侧,小于p的在左侧,right p left
if (k<=right) return partition(arr,start,right,k);
if (k>=right) return partition(arr,left,end,k);
return arr[k];
}
public static void main(String[] args) {
int[]array =new int[10];
for (int i = 0; i < array.length; i++) {
array[i]=(int)(Math.random()*100);
System.out.print(array[i]+",");
}
System.out.println();
quickSort(array,0,array.length-1);
for (int num:array){
System.out.print(num+",");
}
System.out.println();
TheKthLargestElementInTheArray find = new TheKthLargestElementInTheArray();
System.out.println(find.findKthLargest2(array,2));
}