lintcode: Kth Smallest Number in Sorted MatrixShow result

最新推荐文章于 2024-09-20 07:54:43 发布

martin_liang

最新推荐文章于 2024-09-20 07:54:43 发布

阅读量391

点赞数

分类专栏： C++/C 算法 lintcode

本文链接：https://blog.csdn.net/martin_liang/article/details/50743390

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

lintcode

66 篇文章 0 订阅

订阅专栏

Kth Smallest Number in Sorted Matrix

30:00

Start

Find the kth smallest number in at row and column sorted matrix.

Have you met this question in a real interview?

Yes

Example

Given k = 4 and a matrix:

[
  [1 ,5 ,7],
  [3 ,7 ,8],
  [4 ,8 ,9],
]

return 5

Challenge

O(k log n), n is the maximal number in width and height.

typedef struct Node{  //这题的关键是要创建这样的Node结构体
    int x;
    int y;
    int val;
    Node(int _x, int _y, int _val): x(_x), y(_y), val(_val) {}
    Node():x(-1),y(-1),val(-1) {}
    
   bool operator <(Node a) const  {  return val <= a.val; }
   bool operator >(Node a) const  {  return val > a.val;  } //最小堆需要实现 operator >的运算符
}node; 


class Solution {
public:
    /**
     * @param matrix: a matrix of integers
     * @param k: an integer
     * @return: the kth smallest number in the matrix
     */
    int kthSmallest(vector<vector<int> > &matrix, int k) {
        // write your code here
        priority_queue<node, vector<node>, greater<node> >auxQueue;
        
        for (int i=0; i<matrix.size(); i++)
        {
            node n(i, 0, matrix[i][0]);
            auxQueue.push(n);
        }
        
        node retNode;
        for (int i=1; i<=k; i++)
        {
            retNode = auxQueue.top();
            auxQueue.pop();
            
            if (retNode.y+1 < matrix[0].size())
                auxQueue.push(node(retNode.x, retNode.y+1, matrix[retNode.x][retNode.y+1]));
        }
        
        return retNode.val;
    }
};