542. 01 Matrix(BFS)

1. 题目描述

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

The distance between two adjacent cells is 1.
Example 1:

Input:
0 0 0
0 1 0
0 0 0

Output:
0 0 0
0 1 0
0 0 0

2.代码

提示:常规的BFS

class Solution {
public:
    vector<vector<int> > updateMatrix(vector<vector<int> >& matrix) {

        int rows = matrix.size();
        int cols = matrix[0].size();
        vector<vector<int> > res(rows, vector<int>(cols, 0));

        for(int i = 0; i < rows; i++) {
            for(int j = 0; j < cols; j++) {
                if(matrix[i][j] == 1) {
                    bfs(matrix, i, j, res);
                }
            }
        }
        return res;
    }
    void bfs(vector<vector<int> >& matrix, int i, int j, vector<vector<int> >& res) {
        int rows = matrix.size();
        int cols = matrix[0].size();
        queue<pair<int,int>> q;
        q.push(make_pair(i,j));
        int level = 0;
        while(!q.empty()) {
            level++;
            for(int n = q.size(); n > 0; n--) {
                pair<int,int> tmp = q.front();
                q.pop();
                int x = tmp.first;
                int y = tmp.second;
                if(x-1 >= 0) {
                    if(matrix[x-1][y] == 0) {
                        res[i][j] = level;
                        return; 
                    } else {
                        q.push(make_pair(x-1,y));   
                    }
                } 
                if(x+1 < rows) {
                    if(matrix[x+1][y] == 0) {
                        res[i][j] = level;
                        return; 
                    } else {
                        q.push(make_pair(x+1,y));   
                    }
                }
                if(y-1 >= 0) {
                    if(matrix[x][y-1] == 0) {
                        res[i][j] = level;
                        return; 
                    } else {
                        q.push(make_pair(x,y-1));   
                    }
                }
                if(y+1 < cols) {
                    if(matrix[x][y+1] == 0) {
                        res[i][j] = level;
                        return; 
                    } else {
                        q.push(make_pair(x,y+1));   
                    }
                }               
            }
        }

    }
};

联系邮箱:sysuygm@163.com
欢迎赐教!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
The Kevin Bacon game is a popular trivia game that is played by connecting Hollywood actors to Kevin Bacon through their movies. The game has inspired various computer-based versions, including one that is implemented using the breadth-first search (BFS) algorithm in Python. Breadth-first search is a graph traversal algorithm that operates by exploring all the vertices at a given depth before moving on to the vertices at the next depth level. This makes it a perfect algorithm for traversing the relationship network of movie stars and linking them to Kevin Bacon. To implement the Kevin Bacon game using BFS in Python, the first step is to represent the relationships between the actors and movies as a graph. This can be done using an adjacency list or adjacency matrix representation. Once the graph is created, the BFS algorithm can be applied to traverse the graph and find the shortest path between two actors. The BFS algorithm starts with the starting actor – in this case, Kevin Bacon – and explores all the actors connected to him through the movies they have starred in. Then, it examines all the actors connected to these actors, and so on until the target actor is found. Along the way, the algorithm keeps track of the path taken to reach the target actor. The Python implementation of the Kevin Bacon game using BFS is a fun and interactive way to explore the relationships between Hollywood actors and their movies. It is also a great example of the versatile uses of graph traversal algorithms like BFS in solving real-world problems.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值