LeetCode: Battleships in a Board
2016-11-21 13:29
351 查看
Battleships之间并不重叠这个assumption很关键,因此只要看船头就可以判断是不是有一个船
1 public class Solution { 2 public int countBattleships(char[][] board) { 3 int ans = 0; 4 for (int i = 0; i < board.length; i++) { 5 for (int j = 0; j < board[0].length; j++) { 6 if (board[i][j] == 'X' && ((i != 0 && board[i-1][j] != 'X') || i == 0) && ((j != 0 && board[i][j-1] !='X') || j == 0)) 7 ans++; 8 } 9 } 10 return ans; 11 } 12 }
相关文章推荐
- Leetcode 419 Battleships in a Board
- LeetCode题解:Battleships in a Board
- [LeetCode] 419-Battleships in a Board
- [LeetCode]419 Battleships in a Board(暴力,dfs)
- 419. [LeetCode]Battleships in a Board
- LeetCode-Battleships in a Board
- Leetcode: Battleships in a Board
- [LeetCode] Battleships in a Board 平板上的战船
- 419. Battleships in a Board
- leetcode_419. Battleships in a Board ? 待解决
- Battleships in a Board [Leetcode]
- Battleships in a Board
- Battleships in a Board
- Leetcode 419 Battleships in a Board
- 419. Battleships in a Board
- LeetCode #419: Battleships in a Board
- LeetCode:419. Battleships in a Board
- Battleships in a Board
- 419. Battleships in a Board
- leetcode 419 Battleships in a Board C++