题目:
题解:
class Solution:def kthSmallest(self, matrix: List[List[int]], k: int) -> int:n = len(matrix)def check(mid):i, j = n - 1, 0num = 0while i >= 0 and j < n:if matrix[i][j] <= mid:num += i + 1j += 1else:i -= 1return num >= kleft, right = matrix[0][0], matrix[-1][-1]while left < right:mid = (left + right) // 2if check(mid):right = midelse:left = mid + 1return left