leetcode::grid_illumination::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< int >	gridIllumination (int n, vector< vector< int > > &lamps, vector< vector< int > > &queries)

详细描述

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

成员函数说明

gridIllumination()

vector< int > leetcode::grid_illumination::Solution::gridIllumination ( int  n, vector< vector< int > > &  lamps, vector< vector< int > > &  queries  )

static

< 从左上到右下的对角线

< 从右上到左下的对角线

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

                                                                                                              {
            auto ls        = unordered_set<pair<int, int>, pair_hash>();
            auto row       = unordered_map<int, int>();
            auto col       = unordered_map<int, int>();
            auto diag_down = unordered_map<int, int>();
            auto diag_up   = unordered_map<int, int>();
            for(auto lamp: lamps) {
                int x  = lamp[0];
                int y  = lamp[1];
                auto p = make_pair(x, y);
                if(!ls.contains(p)) {
                    ls.insert(p);
                    row[x]++;
                    col[y]++;
                    diag_down[n - x + y]++;
                    diag_up[x + y]++;
                }
            }
            auto ans = vector<int>();
            for(auto query: queries) {
                int query_x = query[0];
                int query_y = query[1];
                if(row[query_x] > 0 || col[query_y] > 0 || diag_down[n - query_x + query_y] > 0 || diag_up[query_x + query_y] > 0) {
                    ans.push_back(1);
                } else {
                    ans.push_back(0);
                }
                pair<int, int> adjacents[9] = {make_pair(query_x + 1, query_y + 1), make_pair(query_x + 1, query_y), make_pair(query_x + 1, query_y - 1),
                                               make_pair(query_x, query_y + 1), make_pair(query_x, query_y), make_pair(query_x, query_y - 1),
                                               make_pair(query_x - 1, query_y + 1), make_pair(query_x - 1, query_y), make_pair(query_x - 1, query_y - 1)};
                for(auto adjacent: adjacents) {
                    if(ls.contains(adjacent)) {
                        ls.erase(adjacent);
                        auto [x, y] = adjacent;
                        row[x]--;
                        col[y]--;
                        diag_down[n - x + y]--;
                        diag_up[x + y]--;
                    }
                }
            }
            return ans;
        }

被这些函数引用 leetcode::grid_illumination::TEST().

---

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

• leetcode.h
• leetcode.cpp