leetcode::path_with_maximum_gold::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	get_sum (int current, int x, int y, int m, int n, vector< vector< int > > &grid, bool **occupied)
static int	getMaximumGold (vector< vector< int > > &grid)

详细描述

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

成员函数说明

get_sum()

int leetcode::path_with_maximum_gold::Solution::get_sum ( int  current, int  x, int  y, int  m, int  n, vector< vector< int > > &  grid, bool **  occupied  )

static

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

                                                                                                                 {
            pair<int, int> nexts[] = {make_pair(x + 1, y), make_pair(x - 1, y), make_pair(x, y + 1), make_pair(x, y - 1)};
            int maximum            = current;
            for(auto [next_x, next_y]: nexts) {
                if(0 <= next_x && next_x < m && 0 <= next_y && next_y < n && grid[next_x][next_y] != 0 && !occupied[next_x][next_y]) {
                    auto *occupied_cpy = new bool *[m];
                    for(int i = 0; i < m; i++) {
                        occupied_cpy[i] = new bool[n];
                        memcpy(occupied_cpy[i], occupied[i], n * sizeof(bool));
                    }
                    occupied_cpy[next_x][next_y] = true;
                    maximum                      = max(maximum, get_sum(current + grid[next_x][next_y], next_x, next_y, m, n, grid, occupied_cpy));
                    for(int i = 0; i < m; i++) {
                        delete[] occupied_cpy[i];
                    }
                    delete[] occupied_cpy;
                }
            }
            return maximum;
        }

引用了 get_sum().

被这些函数引用 get_sum() , 以及 getMaximumGold().

getMaximumGold()

int leetcode::path_with_maximum_gold::Solution::getMaximumGold ( vector< vector< int > > &  grid )

static

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

                                                              {
            const int m = grid.size();
            const int n = grid[0].size();
            int ans     = 0;
            for(int i = 0; i < m; i++) {
                for(int j = 0; j < n; j++) {
                    if(grid[i][j] != 0) {
                        auto *occupied = new bool *[m];
                        for(int k = 0; k < m; k++) {
                            occupied[k] = new bool[n];
                            memset(occupied[k], 0, n * sizeof(bool));
                        }
                        occupied[i][j] = true;
                        ans            = max(ans, get_sum(grid[i][j], i, j, m, n, grid, occupied));
                        for(int k = 0; k < m; k++) {
                            delete[] occupied[k];
                        }
                        delete[] occupied;
                    }
                }
            }
            return ans;
        }

引用了 get_sum().

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

---

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

• leetcode.h
• leetcode.cpp