LeetCode 419. Battleships in a Board

原创 2017年01月03日 17:19:48

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 (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.


阅读题目,可以得知一下几个信息:

1.所谓的BattleShip其实就是x.

2.每个BattleShip之间会有.分割..

3.每个BattleShip应该是1*n个X或者是n*1的x组成的...

所以算法如下:

public class Solution {
    public int countBattleships(char[][] board) {
        int sum = 0;
        int a = board.length;
        int b = board[0].length;
        if(a == 0 || b == 0)
            return 0;
        for(int i=0;i<a;i++)
        {
            for(int j=0;j<b;j++)
            {
                if(board[i][j] == '.')
                    continue;
                if(i>0 && board[i-1][j] == 'X')
                    continue;
                if(j>0 && board[i][j-1] == 'X')
                    continue;
                sum++;
            }
        }
        return sum;
    }
}
只需要排除非法选项就可以了.

1.当字符为.的时候

2.当i>0,board[i][j] = 'X' 并且board[i-1][j] ='X'时,也就是竖方向上有相连的X,这种情况下看做是同一个BattleShip

3.当j>0,board[i][j] = 'X' 并且board[i][j-1] = 'X'时,也就是横方向上有相连的X,也看做同一个...


除此之外的所有情况都是合法的.return sum就可以了.

版权声明:本文为博主原创文章,转载请注明出处哦~

Leetcode 419. Battleships in a Board 战舰数量 解题报告

1 解题报告这个题,就是用矩阵一个放战舰的地方,X是放的地方,.是空槽 他肯定给成横着的一条或者竖着的一条,而且肯定有隔离,不会交叉。。现在求出有多少个战舰因为给定的数据肯定是有效的,所以我们直接统...
  • MebiuW
  • MebiuW
  • 2016年10月20日 20:38
  • 2418

LeetCode 419. Battleships in a Board 题解(C++)

Given an 2D board, count how many different battleships are in it. The battleships are represented w...

LeetCode笔记:419. Battleships in a Board

计算面板中战舰的数量

LeetCode 419. Battleships in a Board 解题报告

LeetCode 419. Battleships in a Board 解题报告

[LeetCode] 419. Battleships in a Board 解题报告

Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, ...
  • a921122
  • a921122
  • 2017年02月16日 11:49
  • 154

leetcode 419. Battleships in a Board

leetcode 419. Battleships in a BoardQuestionGiven an 2D board, count how many different battleships ...

【LeetCode】419. Battleships in a Board

leetcode 419 battleships in a board

LeetCode--419. Battleships in a Board

一,题目截图二,编程语言知识回顾–C++ vector   vector(向量): C++中的一种数据结构,确切的说是一个类。它相当于一个动态的数组,当程序员无法知道自己需要的数组的规模多大时,用其来...

【LeetCode】419. Battleships in a Board

问题描述问题链接:https://leetcode.com/problems/battleships-in-a-board/#/descriptionGiven an 2D board, count ...
  • mrbcy
  • mrbcy
  • 2017年03月15日 20:16
  • 173

Leetcode 419 - Battleships in a Board(dfs)

题意给一个格点图,其中’X’代表当前位置有战舰,’.’代表当前位置为空位。其中,战舰只能横着放或者竖着放,并且长度为N(N为任意值)。并且,相邻两个战舰之间必须相隔一个格子。求:所以的战舰数目。思路算...
  • Lzedo
  • Lzedo
  • 2017年03月14日 12:01
  • 127
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode 419. Battleships in a Board
举报原因:
原因补充:

(最多只允许输入30个字)