题目:
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.
Note that it is the kth smallest element in the sorted order, not the kth distinct element.
Example:
matrix = [ [ 1, 5, 9], [10, 11, 13], [12, 13, 15] ], k = 8, return 13.
Note:
You may assume k is always valid, 1 ≤ k ≤ n2.
题意:
给定一个n*n矩阵,矩阵的每一行,每一列都是有序的,请找出矩阵中第k小的数,第k小的数指的是排序后数组中的第k个数。
代码:
class Solution(object):
def kthSmallest(self, matrix, k):
"""
:type matrix: List[List[int]]
:type k: int
:rtype: int
"""
n = len(matrix)
order_lis = []
for i in range(n) :
order_lis.extend(matrix[i]) #将矩阵放在一个列表中
order_lis.sort()
return order_lis[k-1]
笔记:
试了其他方法,貌似上面方法还挺快的: