题解 | #排序输出#
寻找第K大
http://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf
# -*- coding:utf-8 -*-
class Solution:
def findKth(self, a, n, K):
# write code here
if K>n:
return False
a.sort(reverse = True)
return a[K-1]
查看17道真题和解析