Battleships in a Board
2017-02-13 22:38
295 查看
Given an 2D board, count how many battleships are in it. The battleships are represented with
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
At least one horizontal or vertical cell separates between two battleships - there are no adjacent battleships.
Example:
In the above board there are 2 battleships.
Invalid Example:
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?
Solution: 找到battleship的起点和终点。由于battleship只能横放或竖放,所以battleship的上边或左边必须为'.'。
'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?
Solution: 找到battleship的起点和终点。由于battleship只能横放或竖放,所以battleship的上边或左边必须为'.'。
1 public class Solution { 2 public int countBattleships(char[][] board) { 3 if (board == null || board[0] == null) return 0; 4 5 int m = board.length, n = board[0].length; 6 int result = 0; 7 for (int i = 0; i < m; i++) { 8 for (int j = 0; j < n; j++) { 9 if (board[i][j] == '.' || (i > 0 && board[i - 1][j] == 'X') || (j > 0 && board[i][j - 1] == 'X')) 10 continue; 11 else result++; 12 } 13 } 14 return result; 15 } 16 }
相关文章推荐
- LeetCode 419 Battleships in a Board (DFS 或 模拟)
- Battleships in a Board
- leetcode oj java Battleships in a Board
- Battleships in a Board
- Battleships in a Board问题及解法
- battleships-in-a-board
- Battleships in a Board 题解
- Leetcode 419 Battleships in a Board
- leetcode 419 Battleships in a Board C++
- Battleships in a Board战列舰队问题解法分析
- LeetCode:419. Battleships in a Board
- Battleships in a Board(统计战舰数)
- [LeetCode]Battleships in a Board 战舰数目
- LeetCode #419: Battleships in a Board
- Battleships in a Board
- Battleships in a Board [Leetcode]
- LeetCode Battleships in a Board
- LeetCode[419] Battleships in a Board
- [LeetCode] Battleships in a Board 平板上的战船
- ASP.NET AJAX in Action—MessageBoard