LeetCode 419 Battleships in a Board (DFS 或 模拟)

Given an 2D board, count how many different battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules:

• You receive a valid board, made of only battleships or empty slots.
• Battleships can only be placed horizontally or vertically. In other words, they can only be made of the shape 1xN (1 row, N columns) or Nx1 (N rows, 1 column), where N can be of any size.
• At least one horizontal or vertical cell separates between two battleships - there are no adjacent battleships.

Example:

X..X
...X
...X

In the above board there are 2 battleships.

Invalid Example:

...X
XXXX
...X

This is not a valid board - as battleships will always have a cell separating between them.

Your algorithm should not modify the value of the board.

题目链接：https://leetcode.com/problems/battleships-in-a-board/

题目分析：因为保证位置合法，直接搜连通块可数就行了，或者遍历找船的一头

public class Solution {
    
    static int[] dx = {0, 1, 0, -1};
    static int[] dy = {1, 0, -1, 0};
    
    void DFS(int x, int y, int n, int m, char[][] board, boolean[][] vis) {
        vis[x][y] = true;
        for (int i = 0; i < 4; i ++) {
            int xx = x + dx[i];
            int yy = y + dy[i];
            if (xx >= 0 && yy >= 0 && xx < n && yy < m && board[xx][yy] == 'X' && !vis[xx][yy]) {
                DFS(xx, yy, n, m, board, vis);
            }
        }
    }
    
    public int countBattleships(char[][] board) {
        int n = board.length;
        if (n == 0) {
            return 0;
        }
        int m = board[0].length;
        int cnt = 0;
        boolean[][] vis = new boolean[n + 1][m + 1];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                if (board[i][j] == 'X' && !vis[i][j]) {
                    DFS(i, j, n, m, board, vis);
                    cnt ++;
                }
            }
        }
        return cnt;
    }
}