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 ≤ n2.
Subscribe to see which companies asked this question
使用堆排进行实现。实现一个最大堆,然后进行扫描一遍,然后就可以得到想要的结果。
public class Solution {
public int kthSmallest(int[][] matrix, int k) {
PriorityQueue<Integer> heap = new PriorityQueue<Integer>(new Comparator<Integer>(){
public int compare(Integer a0, Integer a1){
if(a0 > a1){
return -1;
}else if(a0 < a1){
return 1;
}
return 0;
}
}
);//最大堆
for(int i = 0; i < matrix.length; i++){
for(int j = 0; j < matrix.length; j++){
if(i*matrix.length + j + 1 > k){
if(matrix[i][j] < heap.peek()){
heap.poll();
heap.offer(matrix[i][j]);
}
}else{
heap.offer(matrix[i][j]);
}
}
}
return heap.peek();
}
}