leetcode::map_of_highest_peak::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< vector< int > >	highestPeak (vector< vector< int > > &isWater)

详细描述

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

成员函数说明

highestPeak()

vector< vector< int > > leetcode::map_of_highest_peak::Solution::highestPeak ( vector< vector< int > > &  isWater )

static

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

                                                                              {
            const int m    = isWater.size();
            const int n    = isWater[0].size();
            auto *occupied = new bool *[m];
            for(int i = 0; i < m; i++) {
                occupied[i] = new bool[n];
                memset(occupied[i], 0, n * sizeof(bool));
            }
            auto que = queue<pair<int, int>>();
            for(int i = 0; i < m; i++) {
                for(int j = 0; j < n; j++) {
                    if(isWater[i][j] == 1) {
                        que.push(pair(i, j));
                        isWater[i][j]  = 0;
                        occupied[i][j] = true;
                    } else {
                        isWater[i][j] = 1;
                    }
                }
            }
            while(!que.empty()) {
                pair<int, int> current = que.front();
                que.pop();
                pair<int, int> nexts[4] = {pair(current.first + 1, current.second),
                                           pair(current.first - 1, current.second),
                                           pair(current.first, current.second + 1),
                                           pair(current.first, current.second - 1)};
                for(auto next: nexts) {
                    if(0 <= next.first && next.first < m && 0 <= next.second && next.second < n && !occupied[next.first][next.second]) {
                        isWater[next.first][next.second]  = isWater[current.first][current.second] + 1;
                        occupied[next.first][next.second] = true;
                        que.push(next);
                    }
                }
            }
            delete[] occupied;
            return isWater;
        }

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

---

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

• leetcode.h
• leetcode.cpp