二分查找法
矩阵中最小值为左上角值,最大值为右下角值,令这两个值为二分查找的初始边界left和right
对于mid = left + right/2,在矩阵中查找小于等于它的值的数量num,如果num >k,则应该在(left,mid)中继续查找,否则在(mid+1,right)中查找
class Solution {
public:
bool check(vector<vector<int>>& matrix, int mid,int k)
{
int i = matrix.size()-1;
int j = 0;
int num = 0;
while(i >= 0 && j<matrix[0].size())
{
if(matrix[i][j] <= mid)
{
j++;
num += i + 1;
}else{
i--;
}
}
return num >= k;
}
int kthSmallest(vector<vector<int>>& matrix, int k) {
int n = matrix.size();
int l = matrix[0][0];
int r = matrix[n-1][n-1];
while(l < r)
{
int mid = l + (r-l)/2;
if(check(matrix,mid,k))
{
r = mid;
}else{
l = mid +1;
}
}
return l;
}
};