add: leetcode 419 solution

This commit is contained in:
Don2025
2022-07-02 13:45:04 +08:00
parent 3f0ef3a415
commit c217fa252c

View File

@ -0,0 +1,21 @@
package leetcode
func countBattleships(board [][]byte) (ans int) {
if len(board) == 0 || len(board[0]) == 0 {
return 0
}
for i := range board {
for j := range board[i] {
if board[i][j] == 'X' {
if i > 0 && board[i-1][j] == 'X' {
continue
}
if j > 0 && board[i][j-1] == 'X' {
continue
}
ans++
}
}
}
return
}