'X's, empty slots are represented with
'.'s. You may assume the following rules:
1xN(1 row, N columns) or
Nx1(N rows, 1 column), where N can be of any size.
X..X ...X ...XIn the above board there are 2 battleships.
...X XXXX ...XThis is an invalid board that you will not receive - as battleships will always have a cell separating between them.
Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?