419. Battleships in a Board

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) orNx1 (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?

解法1：

规定了舰队的形式只能为一行或者一列若干个X，而且边界不相交，那么舰队要么是单个的X，要么是“条状”的X

可以利用“条状”的X的性质，即处于条状两端的X只有一个邻居是X，每两个这样的端点组成一对，代表一个舰队，另外加上单独的X，就是舰队的总数，空间O(1)，one pass

public class Solution {
    public int countBattleships(char[][] board)
	{
		int m=board.length;
		if(m<1)
			return 0;
		int n=board[0].length;
		int count_single=0;
		int count_block=0;
		int[] xoff={1,-1,0,0};
		int[] yoff={0,0,1,-1};
		
		for(int i=0;i<m;i++)
			for(int j=0;j<n;j++)
			{
				char c=board[i][j];
				if(c=='X')
				{
					int cnt=0;
					for(int k=0;k<4;k++)
					{
						int xx=i+xoff[k];
						int yy=j+yoff[k];
						if(xx>=0&&xx<m&&yy>=0&&yy<n)
							if(board[xx][yy]=='X')
								cnt++;
					}
					if(cnt==0)
						count_single++;
					else if(cnt==1)
						count_block++;
				}
			}
		
		return count_single+count_block/2; 
	}
}

-----------------------------------------------------------------------

解法2：

https://discuss.leetcode.com/topic/62970/simple-java-solution

Going over all cells, we can count only those that are the "first" cell of the battleship. First cell will be defined as the most top-left cell. We can check for first cells by only counting cells that do not have an 'X' to the left and do not have an 'X' above them.

    public int countBattleships(char[][] board) {
        int m = board.length;
        if (m==0) return 0;
        int n = board[0].length;
        
        int count=0;
        
        for (int i=0; i<m; i++) {
            for (int j=0; j<n; j++) {
                if (board[i][j] == '.') continue;
                if (i > 0 && board[i-1][j] == 'X') continue;
                if (j > 0 && board[i][j-1] == 'X') continue;
                count++;
            }
        }
        
        return count;
    }