@@ -563,7 +563,9 @@ function solve(board) {
563563
564564### Go
565565
566- ``` dfs
566+ dfs:
567+ 568+ ``` go
567569var DIRECTIONS = [4 ][2 ]int {{-1 , 0 }, {0 , -1 }, {1 , 0 }, {0 , 1 }}
568570
569571func solve (board [][]byte ) {
@@ -613,6 +615,64 @@ func dfs(board [][]byte, i, j int) {
613615}
614616```
615617
618+ bfs:
619+ 620+ ``` go
621+ var DIRECTIONS = [4 ][2 ]int {{-1 , 0 }, {0 , -1 }, {1 , 0 }, {0 , 1 }}
622+ 623+ func solve (board [][]byte ) {
624+ rows , cols := len (board), len (board[0 ])
625+ // 列
626+ for i := 0 ; i < rows; i++ {
627+ if board[i][0 ] == ' O'
628+ bfs (board, i, 0 )
629+ }
630+ if board[i][cols-1 ] == ' O'
631+ bfs (board, i, cols-1 )
632+ }
633+ }
634+ // 行
635+ for j := 0 ; j < cols; j++ {
636+ if board[0 ][j] == ' O'
637+ bfs (board, 0 , j)
638+ }
639+ if board[rows-1 ][j] == ' O'
640+ bfs (board, rows-1 , j)
641+ }
642+ }
643+ 644+ for _ , r := range board {
645+ for j , c := range r {
646+ if c == ' A'
647+ r[j] = ' O'
648+ }
649+ if c == ' O'
650+ r[j] = ' X'
651+ }
652+ }
653+ }
654+ }
655+ 656+ func bfs (board [][]byte , i , j int ) {
657+ queue := [][]int {{i, j}}
658+ board[i][j] = ' A'
659+ for len (queue) > 0 {
660+ cur := queue[0 ]
661+ queue = queue[1 :]
662+ for _ , d := range DIRECTIONS {
663+ x , y := cur[0 ]+d[0 ], cur[1 ]+d[1 ]
664+ if x < 0 || x >= len (board) || y < 0 || y >= len (board[0 ]) {
665+ continue
666+ }
667+ if board[x][y] == ' O'
668+ board[x][y] = ' A'
669+ queue = append (queue, []int {x, y})
670+ }
671+ }
672+ }
673+ }
674+ ```
675+ 616676<p align =" center " >
617677<a href =" https://programmercarl.com/other/kstar.html " target =" _blank " >
618678 <img src =" ../pics/网站星球宣传海报.jpg " width =" 1000 " />
0 commit comments