started bfs exercise 130

Author: n1i9c9k9

Diff for: C++/surrounded-regions.cpp

@@ -0,0 +1,59 @@
+class Solution {
+public:
+    void solve(vector<vector<char>>& board) {
+        int m = board.size();
+        int n = board[0].size();
+        std::vector<std::pair<int, int>> allOs;
+
+        //all Os on edge
+        for(int i = 0; i < n; ++i){
+            //firstRow
+            if(board[0][i] == 'O'){
+                allOs.emplace_back(0,i);
+            }
+            //lastRow
+            if(board[m-1][i]=='O'){
+                allOs.emplace_back(m-1,i);
+            }
+        }
+
+        for(int j = 1; j < m-1; ++j){
+            //first column. without corner
+            if(board[j][0]=='O'){
+                allOs.emplace_back(j,0);
+            }
+            //last column without corner
+            if(board[j][n-1]=='O'){
+                allOs.emplace_back(j,n-1);
+            }
+        }
+        std::cout<<allOs.size()<<std::endl;
+    }
+    void nearByO(vector<vector<char>>& board, std::pair<int, int>& coordinate){
+    int y = coordinate.first;
+    int x = coordinate.second;
+
+    std::vector<std::pair<int,int>> directions = {
+        {1, 0},
+        {0, 1},
+        {0, -1},
+        {-1, 0}
+    }
+
+    for(const std::pair<int, int>& dir : directions){
+        int newY = y + dir.first;
+        int newX = x + dir.second;
+        if(newY >=0 &&  newY < board.size() && newX >= 0 && newX < board[0].size())){
+            if(board[newY][newX] == 'O')
+        }
+
+    }
+
+        if(board[y+1][x] =='O'){
+            allOs.emplace_back(y+1,x);
+        }
+        if(board[y-1][x] =='O')
+        if(board[y][x+1] =='O')
+        if(board[y][x-1] =='O')
+    }
+};