378. Kth Smallest Element in a Sorted Matrix

最新推荐文章于 2020-07-05 11:23:35 发布

原创最新推荐文章于 2020-07-05 11:23:35 发布 · 263 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

刷题专栏收录该内容

126 篇文章

订阅专栏

本文介绍了一种高效算法，用于在一个n x n的矩阵中寻找第k小的元素，该矩阵的每一行和每一列都按升序排列。通过使用二分搜索策略，可以在对数时间内找到目标元素。

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

class Solution {
    public int kthSmallest(int[][] matrix, int k) {
        int lo = matrix[0][0], hi = matrix[matrix.length - 1][matrix[0].length - 1] + 1;//[lo, hi)
        while(lo < hi) {
            int mid = lo + (hi - lo) / 2;
            int count = 0, j = matrix[0].length - 1;
            for(int i = 0; i < matrix.length; i++) {
                while(j >= 0 && matrix[i][j] > mid) j--;
                count += (j + 1);
            }
            if(count < k) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
}