leintcode Kth Largest Element python

最新推荐文章于 2025-08-20 15:37:55 发布

我不是狼

最新推荐文章于 2025-08-20 15:37:55 发布

阅读量249

点赞数

CC 4.0 BY-SA版权

分类专栏： lintcode 文章标签： python Kth Largest Element

本文链接：https://blog.youkuaiyun.com/u012073033/article/details/89636385

lintcode 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种基于快速排序思想的算法，用于在数组中查找第K大的元素。通过实现sort_info和kthLargestElement两个核心函数，有效地解决了这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Find K-th largest element in an array.

参考快速排序的思想

class Solution:
    """
    @param n: An integer
    @param nums: An array
    @return: the Kth largest element
    """
    def sort_info(self,begin,end,nums):
        if len(nums)==1:return 0,nums
        temp = nums[begin]
        less_index = begin
        more_index = end
        flag = begin
        while(less_index< more_index):
            while(less_index< more_index and temp>=nums[more_index] and flag!= more_index):
                more_index -= 1

            while(less_index <= more_index and temp < nums[less_index] and flag != less_index):
                less_index += 1
            flag = more_index if flag==less_index else less_index
            nums[less_index],nums[more_index] = nums[more_index],nums[less_index]
        return flag,nums

    def kthLargestElement(self, n, nums):
        # write your code here
        flag,nums = self.sort_info(0,len(nums)-1,nums)
        while(1) :
            if flag == n-1:
                return nums[n-1]
            elif flag > n-1:
                nums = nums[:flag]
                flag,nums = self.sort_info(0,len(nums)-1,nums)
            else:
                nums = nums[flag+1:]
                n = n - flag-1
                flag,nums = self.sort_info(0,len(nums)-1,nums)