leetcode::k_highest_ranked_items_within_a_price_range::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< vector< int > >	highestRankedKItems (vector< vector< int > > &grid, vector< int > &pricing, vector< int > &start, int k)

详细描述

在文件 leetcode.h 第 620 行定义.

成员函数说明

highestRankedKItems()

vector< vector< int > > leetcode::k_highest_ranked_items_within_a_price_range::Solution::highestRankedKItems ( vector< vector< int > > & grid, vector< int > & pricing, vector< int > & start, int k )

static

在文件 leetcode.cpp 第 1338 行定义.

                                                                                                                                    {
            const auto m    = grid.size();
            const auto n    = grid[0].size();
            auto ans        = vector<vector<int>>();
            const auto low  = pricing[0];
            const auto high = pricing[1];
            const auto row  = start[0];
            const auto col  = start[1];
            auto pq         = priority_queue<item>();
            pq.push(item(0, grid[row][col], row, col));
            grid[row][col] = 0;
            while(pq.empty() && k != 0) {
                auto current = pq.top();
                pq.pop();
                if(current.price != 1 && current.price >= low && current.price <= high) {
                    k--;
                    auto vec = vector<int>();
                    vec.push_back(current.row);
                    vec.push_back(current.col);
                    ans.push_back(vec);
                }
                pair<int, int> nexts[4] = {pair(current.row + 1, current.col),
                                           pair(current.row - 1, current.col),
                                           pair(current.row, current.col + 1),
                                           pair(current.row, current.col - 1)};
                for(const pair<int, int> next: nexts) {
                    if(0 <= next.first && next.first < m && 0 <= next.second && next.second < n && grid[next.first][next.second] != 0) {
                        pq.push(item(current.distance + 1, grid[next.first][next.second], next.first, next.second));
                        grid[next.first][next.second] = 0;
                    }
                }
            }
            return ans;
        }

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp