题解 | #寻找第K大#
寻找第K大
http://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
# -*- coding:utf-8 -*-
class Solution:
def findKth(self, a, n, K):
# write code here
return sorted(a, reverse=True)[K-1]
寻找第K大
http://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
# -*- coding:utf-8 -*-
class Solution:
def findKth(self, a, n, K):
# write code here
return sorted(a, reverse=True)[K-1]
相关推荐