Leetcode1020. 飞地的数量

最新推荐文章于 2024-11-14 15:56:18 发布

meeiuliuus

最新推荐文章于 2024-11-14 15:56:18 发布

阅读量476

点赞数 9

分类专栏： # leetcode ---medium 文章标签：算法

本文链接：https://blog.csdn.net/qq_52313711/article/details/136802787

版权

leetcode ---medium 专栏收录该内容

174 篇文章 0 订阅

订阅专栏

题目：

代码(首刷自解 2024年3月18日）：

class Solution {
public:
    bool flag = false;
    int result = 0;
    int temp;
    int numEnclaves(vector<vector<int>>& grid) {
        if (grid.size() <= 2 || grid[0].size() <= 2) return 0;
        result = 0;
        for (int i = 0; i < grid.size(); ++i)
        {
            for (int j = 0; j < grid[0].size(); ++j)
            {
                if (grid[i][j] == 1)
                {
                    flag = false;
                    temp = 1;
                    grid[i][j] = -1;
                    dfs(grid, i, j);
                    if (flag == false)
                    {
                        result += temp;
                    }
                }
            }
        }
        return result;
    }
    int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    void dfs(vector<vector<int>>& grid, int row, int col)
    {
        if (row == 0 || row == grid.size() - 1 || col == 0 || col == grid[0].size() - 1)
        {
            flag = true;
        }
        for (int i = 0; i < 4; ++i)
        {
            int newrow = row + dir[i][0];
            int newcol = col + dir[i][1];
            if (newrow >= 0 && newrow < grid.size() && newcol >= 0 
            && newcol < grid[0].size() && grid[newrow][newcol] == 1)
            {
                temp++;
                grid[newrow][newcol] = -1;
                dfs(grid, newrow, newcol);
            }
        }
    }
};