419. Battleships in a Board

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?

思路：找到ship的首（一行中最左边或者一列中最上头），所以问题关键在于，遇到一个X，如何判断其是首。显而易见，若一个X是首，其上面和左边都应该是'.'或者是边界。

代码1：

class Solution {
public:
    int battlelen(vector<vector<char>>&board,int i,int j){
        if(i-1>=0 && board[i-1][j]=='X'){return 0;}//up has X
        if(j-1>=0 && board[i][j-1]=='X'){return 0;}//left has X
        int len=1;
        if(i+1<board.size() && board[i+1][j]=='X'){// lie
            while(i+len<board.size() && board[i+len][j]=='X'){len++;}
        }
        else if(j+1<board[0].size() && board[i][j+1]=='X'){// hang
            while(j+len<board[0].size() && board[i][j+len]=='X'){len++;}
        }
        return len-1;
    }
    
    int countBattleships(vector<vector<char>>& board) {
        int sum=0,len=0;
        for(int i=0;i<board.size();i++){
            for(int j=0;j<board[0].size();j++){
                if(board[i][j]=='X'){
                    sum++;
                    int temp=battlelen(board,i,j);
                    len += temp;
                }
            }
        }
        return sum-len;
    }
};

代码2：

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