Skip to content

Update pacific_atlantic_water_flow.cpp #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update pacific_atlantic_water_flow.cpp #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 25 additions & 21 deletions graph_lectures/pacific_atlantic_water_flow.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,30 @@ class Solution {
int cols;
vector<vector<int> > h;



vector<vector<bool> > bfs(queue<pair<int, int> > &qu) {
vector<vector<bool> > visited(rows, vector<bool> (cols, false));
while(not qu.empty()) {
auto cell = qu.front();
qu.pop();
int i = cell.first;
int j = cell.second;
visited[i][j] = true;
for(int d = 0; d < 4; d++) {
int newRow = i+dir[d][0];
int newCol = j+dir[d][1];
if(newRow < 0 or newCol < 0 or newRow >= rows or newCol >= cols) continue; // you exited the grid
if(visited[newRow][newCol]) continue;
if(h[newRow][newCol] < h[i][j]) continue; // h[newRow][newCol] -> neighbours height, h[i][j] -> curr cell's heigh
qu.push({newRow, newCol});
}
}
return visited;
}



vector<vector<int>> pacificAtlantic(vector<vector<int>>& heights) {
rows = heights.size();
cols = heights[0].size();
Expand Down Expand Up @@ -42,28 +66,8 @@ class Solution {
}
return result;
}

vector<vector<bool> > bfs(queue<pair<int, int> > &qu) {
vector<vector<bool> > visited(rows, vector<bool> (cols, false));
while(not qu.empty()) {
auto cell = qu.front();
qu.pop();
int i = cell.first;
int j = cell.second;
visited[i][j] = true;
for(int d = 0; d < 4; d++) {
int newRow = i+dir[d][0];
int newCol = j+dir[d][1];
if(newRow < 0 or newCol < 0 or newRow >= rows or newCol >= cols) continue; // you exited the grid
if(visited[newRow][newCol]) continue;
if(h[newRow][newCol] < h[i][j]) continue; // h[newRow][newCol] -> neighbours height, h[i][j] -> curr cell's heigh
qu.push({newRow, newCol});
}
}
return visited;
}
};
int main() {

return 0;
}
}