0378-kth-smallest-element-in-a-sorted-matrix.adoc

378. Kth Smallest Element in a Sorted Matrix

{leetcode}/problems/kth-smallest-element-in-a-sorted-matrix/[LeetCode - Kth Smallest Element in a Sorted Matrix^]

这里还是要注意一下：从右上角向左移，从上向下移，可以减少比较次数。

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 ≤ n².

link:{sourcedir}/_0378_KthSmallestElementInASortedMatrix.java[role=include]