LeetCode-419. Battleships in a Board
2017-04-16 20:54
197 查看
Given an 2D board, count how many battleships are in it. The battleships are represented with
empty slots 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
row, N columns) or
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?
思路:
当X是抬头位,或者左边or上面都没有X时,一定是一艘新船
'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?
思路:
当X是抬头位,或者左边or上面都没有X时,一定是一艘新船
class Solution { public: int countBattleships(vector<vector<char>>& board) { int count = 0; for(int i=0;i<board.size();i++) for(int j=0;j<board[0].size();j++) if(board[i][j]=='X' && (i==0 || board[i-1][j]!='X') && (j==0 || board[i][j-1]!='X')) count++; return count; } };
相关文章推荐
- leetcode_419. Battleships in a Board ? 待解决
- Leetcode-419. Battleships in a Board
- 【LeetCode】 419. Battleships in a Board
- LeetCode--419. Battleships in a Board
- 419. [LeetCode]Battleships in a Board
- Leetcode 419. Battleships in a Board
- leetcode 419. Battleships in a Board
- [LeetCode] 419-Battleships in a Board
- [LeetCode]419 Battleships in a Board(暴力,dfs)
- LeetCode: Battleships in a Board
- Leetcode: Battleships in a Board
- Leetcode 419 Battleships in a Board
- [LeetCode]419. Battleships in a Board
- 【LeetCode】419. Battleships in a Board
- [LeetCode]419. Battleships in a Board
- LeetCode-Battleships in a Board
- LeetCode题解:Battleships in a Board
- LeetCode[419] Battleships in a Board
- 419. Battleships in a Board
- LeetCode - 434. Number of Segments in a String