Leetcode | Kth Largest Element in an Array (数组中的第K个最大元素)

最新推荐文章于 2021-12-20 23:46:04 发布

ch3ung777

最新推荐文章于 2021-12-20 23:46:04 发布

阅读量97

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/shawnchang777/article/details/113542863

版权

Leetcode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Description:

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.

Example:

Input: [3,2,1,5,6,4] and k = 2
Output: 5

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4

Ideas:

	Python has lots of library functions, like sort().Sort the list from small to large and take the K th elem. 
Its convenient to use in engineering projects with a good efficiency. 
	In order to practice sort algorithm, you can use quickSort to solve this problem.The main idea is the 
list will be splited into two independent parts through a sort, in which one part is smaller than the other 
part, and then these two parts of data will be quickly sorted respectively according to this method.

Code:

class Solution(object):
    def findKthLargest(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        nums.sort()
        return nums[-k]

Execution time：20 ms
Memory consumption：13.6 MB

class Solution(object):
    def findKthLargest(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        # 第k个最大的元素，即升序排列后，index为len(nums)-k
        k = len(nums) - k
        low = 0
        high = len(nums) - 1
        while low <= high:
            p = self.partition(nums, low, high)
            if k < p:
                high = p-1
            elif k > p:
                low = p+1
            else:
                return nums[p]
        return -1
        
    def partition(self, alist, low, high):
        mid_value = alist[low]
        while low < high:
        	# 从high开始，找到小于mid_value的元素，并置于low位置
            while low < high and alist[high] >= mid_value:
                high -= 1
            alist[low] = alist[high]
			
			# 从low开始，找到大于mid_value的元素，并置于high位置
            while low < high and alist[low] <= mid_value:
                low += 1
            alist[high] = alist[low]
        # 此时low==high
        alist[low] = mid_value
        
        return low