leetcode学习笔记50

378. 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.
matrix = [
[ 1, 5, 9],
[10, 11, 13],
[12, 13, 15]
],
k = 8,

return 13.
1、堆排序

class Solution {
    public int kthSmallest(int[][] matrix, int k) {
        PriorityQueue<Tuple> heap=new PriorityQueue<Tuple>();
        for(int i=0;i<matrix[0].length;i++)heap.offer(new Tuple(0,i,matrix[0][i]));
        for(int i=0;i<k-1;i++){
            Tuple t=heap.poll();
            if(t.x>matrix.length-2)continue;
            heap.offer(new Tuple(t.x+1,t.y,matrix[t.x+1][t.y]));
        }
        return heap.poll().val;
    }
}
class Tuple implements Comparable<Tuple>{
    int x,y,val;
    Tuple(int x,int y,int val){
        this.x=x;
        this.y=y;
        this.val=val;
    }
    public int compareTo(Tuple that){
        return this.val-that.val;
    }
}

2、二分查找，这个存疑，还没完全弄懂

class Solution {
    public int kthSmallest(int[][] matrix, int k) {
        int n=matrix.length;
        int low=matrix[0][0],high=matrix[n-1][n-1];
        while(low<=high){
            int mid=low+(high-low)/2;
            int count=helper(matrix,mid);
            if(count<k) low=mid+1;
            else high=mid-1;
        }
        return low;
    }
    public int helper(int[][] matrix, int val) {
        int res=0;
        int n=matrix.length;
        int i=n-1,j=0;
        while(i>=0&&j<n){
            if (matrix[i][j] > val) i--;
            else {
                res += i + 1;
                j++;
            }
        }
        return res;
    }
}