[LeetCode] 215. Kth Largest Element in an Array

本文主要是介绍[LeetCode] 215. Kth Largest Element in an Array，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

题目内容

https://leetcode-cn.com/problems/kth-largest-element-in-an-array/

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.

---

题目思路

我想到的是冒泡排序，先确定K的大小和总体长度关系来确定是选择求最大K个元素还是最小l-k个元素。不过可以通过这道题目来复习一下手写排序算法。

---

程序代码

class Solution(object):def findKthLargest(self, nums, k):""":type nums: List[int]:type k: int:rtype: int"""l=len(nums)if not nums or l<k:return Falseself.quik_sort(nums,0,l-1)return nums[-k]def quik_sort(self,L,left,right):if left <= right:key = L[left]i = leftj = rightwhile i < j:while i < j and key <= L[j]:j -= 1L[i] = L[j]while i < j and L[i] <= key:i += 1L[j] = L[i]L[i] = keyself.quik_sort(L, left, i - 1)self.quik_sort(L, i + 1, right)

 

这篇关于[LeetCode] 215. Kth Largest Element in an Array的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---