419. Battleships in a Board(C++)

原題

Given an 2D board, count how many 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 an invalid board that you will not receive - as battleships will always have a cell separating between them.

Follow up:
Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?

解題思路

題目限定了能使用的內存大小以及不能修改表格，以及函數只能運行一次，所以不能用普通的深度優先算法。但它的題目假設了戰艦只能橫放或者直放，而且相鄰戰艦中間有間隔，所以可以直接判斷某X格的上方和左側是否也為X，來判斷這戰艦是否已經數過。

代碼

class Solution {
public:
    int countBattleships(vector<vector<char>>& board) {
        int count = 0;
        for (int i = 0; i < board.size(); i++) {
            for (int j = 0; j < board[i].size(); j++) {
                if (board[i][j] == 'X') {
                    if (i-1 >= 0 && j-1 >= 0) {
                        if (board[i-1][j] != 'X' && board[i][j-1] != 'X') {
                            count++;
                        }
                        continue;
                    }
                    else if (i-1 >= 0) {
                        if (board[i-1][j] != 'X') {
                            count++;
                        }
                        continue;
                    }
                    else if (j-1 >= 0) {
                        if (board[i][j-1] != 'X'){
                            count++;
                        }
                        continue;
                    } 
                    else {
                        count++;
                    }
                }
            }
        }
        return count;
    }
};

感想

我一開始是打算找到一個X，就把所有的相鄰X以及自身都改為 . 然後把戰艦數加一，但是條件的限制使得這方法不可行，現在的解法比這方法要好很多。