Leetcode 215. Kth Largest Element in an Array

最新推荐文章于 2023-12-15 19:39:48 发布

原创最新推荐文章于 2023-12-15 19:39:48 发布 · 341 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

104 篇文章

订阅专栏

array

29 篇文章

订阅专栏

本文深入探讨了如何利用快速排序的思想来高效地找到未排序数组中的第k大元素，详细解释了算法的核心逻辑、关键步骤，并通过实例演示了具体实现过程。

public class Solution {
    public int findKthLargest(int[] nums, int k) {
      int length = nums.length;

    }
    public int helper(int[] nums, int k, int start, int end){
      int pivot = nums[end];
      int left = start;
      int right = end;
      while(nums[left] <= pivot && left < right){
          left ++;
      }
      while(nums[right] >= pivot && left < right){
          right--;
      }
      if(left == right){
        break;
      }
      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 void swap(int[] nums, int a, int b){
      int tem = nums[a];
      nums[a] = nums[b];
      nums[b] = tem;
    }
}

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.

这道题和快速排序的思路有点像，都是找pivot 然后转换位置，会写quick sort 这个题应该没问题