美文网首页
215. 数组中的第K个最大元素

215. 数组中的第K个最大元素

作者: 葡萄肉多 | 来源:发表于2019-11-11 16:50 被阅读0次

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 1:

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

Example 2:

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

Note:
You may assume k is always valid, 1 ≤ k ≤ array's length.

思路

  1. 排序
class Solution:
    def findKthLargest1(self, nums, k):
        nums = sorted(nums)
        return nums[len(nums)-k]

相关文章

网友评论

      本文标题:215. 数组中的第K个最大元素

      本文链接:https://www.haomeiwen.com/subject/lrvtictx.html