[LeetCode] Battleships in a Board 平板上的戰船
阿新 • • 發佈:2018-12-27
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
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.
這道題好像之前在地裡面見過,忘了是哪家公司的面試題了,現在被LeetCode收錄了,感覺現在LeetCode更新越來越快了,感覺要成為第一大題庫了,贊一個