Leetcode 286. Walls and Gates (Google面试题 BFS,记忆化搜索)
来源:互联网 发布:js包装函数是什么 编辑:程序博客网 时间:2024/05/01 04:14
You are given a m x n 2D grid initialized with these three possible values.
-1
- A wall or an obstacle.0
- A gate.INF
- Infinity means an empty room. We use the value231 - 1 = 2147483647
to representINF
as you may assume that the distance to a gate is less than2147483647
.
Fill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be filled with INF
.
For example, given the 2D grid:
INF -1 0 INFINF INF INF -1INF -1 INF -1 0 -1 INF INF
After running your function, the 2D grid should be:
3 -1 0 1 2 2 1 -1 1 -1 2 -10 -1 3 4
题解:BFS。1. 从门处搜。 2.可以首先把门节点先入队列,O(N*M)复杂度!!!
class Solution {public: void wallsAndGates(vector<vector<int>>& rooms) { //版本1 int m=rooms.size(); if(m==0) return ; int n=rooms[0].size(); for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { if(rooms[i][j]==0) { bfs(i,j,rooms); } } } } struct node{ int x,y; int dis; }; void bfs(int sx,int sy,vector<vector<int>>& rooms) { int dir[][2]={-1,0,1,0,0,1,0,-1}; int m=rooms.size(),n=rooms[0].size(); queue<node> Queue; node start; start.x=sx,start.y=sy;start.dis=0; Queue.push(start); while(!Queue.empty()) { node cur=Queue.front(); Queue.pop(); node nex; for(int i=0;i<4;i++) { nex.x=cur.x+dir[i][0]; nex.y=cur.y+dir[i][1]; nex.dis=cur.dis+1; if(nex.x<0||nex.x>=m||nex.y<0||nex.y>=n||rooms[nex.x][nex.y]<=0||nex.dis>=rooms[nex.x][nex.y]) continue; rooms[nex.x][nex.y]=min(rooms[nex.x][nex.y],nex.dis); Queue.push(nex); } } }};
class Solution {public: void wallsAndGates(vector<vector<int>>& rooms) { //版本2 int m=rooms.size(); if(m==0) return ; int n=rooms[0].size(); queue<node> Queue; for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { if(rooms[i][j]==0) { node gate; gate.x=i,gate.y=j; gate.dis=0; Queue.push(gate); } } } int dir[][2]={-1,0,1,0,0,1,0,-1}; while(!Queue.empty()) { node cur=Queue.front(); Queue.pop(); node nex; for(int i=0;i<4;i++) { nex.x=cur.x+dir[i][0]; nex.y=cur.y+dir[i][1]; nex.dis=cur.dis+1; if(nex.x<0||nex.x>=m||nex.y<0||nex.y>=n||rooms[nex.x][nex.y]<=0||nex.dis>=rooms[nex.x][nex.y]) continue; rooms[nex.x][nex.y]=min(rooms[nex.x][nex.y],nex.dis); Queue.push(nex); } } } struct node{ int x,y; int dis; };};
0 0
- Leetcode 286. Walls and Gates (Google面试题 BFS,记忆化搜索)
- Leetcode 286.Walls and Gates
- LeetCode 286. Walls and Gates
- Leetcode 286. Walls and Gates
- LeetCode 286. Walls and Gates
- *LeetCode-Walls and Gates
- Leetcode: Walls and Gates
- [leetcode] 286. Walls and Gates 解题报告
- [Leetcode] 286. Walls and Gates 解题报告
- 286. Walls and Gates
- 286. Walls and Gates
- leetcode 286: Walls and Gates
- [Leetcode 286]: Walls and Gates
- LeetCode 286. Walls and Gates(墙与门)
- LeetCode 题解(259) : Walls and Gates
- [LeetCode286]Walls and Gates
- Walls and Gates
- Walls and Gates
- 天天写业务代码,如何成为技术大牛?
- 地域性与忽略大小写的字符串比较
- Codeforces 230B
- jzoj 4812. 【NOIP2016提高A组五校联考2】string 排列组合+乘法逆元
- nginx.org的Using nginx as HTTP load balancer页面翻译
- Leetcode 286. Walls and Gates (Google面试题 BFS,记忆化搜索)
- 前端人员必须会的jsonp!
- 如何从技术菜鸟成为“10倍效率”开发者
- NRF24L01双向传输数据
- Android学习笔记-事件处理机制
- Android——View的工作原理(一)
- 多线程练习
- faster rcnn matlab
- iOS学习之定位