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就可以了.

版权声明:本文为博主原创文章,转载请注明出处哦~ https://blog.csdn.net/u012385432/article/details/53996183

LeetCode 419. Battleships in a Board 解题报告

LeetCode 419. Battleships in a Board 解题报告
  • camellhf
  • camellhf
  • 2016-10-20 12:16:25
  • 3871

LeetCode #419: Battleships in a Board

Problem Statement(Source) Given an 2D board, count how many different battleships are in it. The bat...
  • junchen1992
  • junchen1992
  • 2016-10-20 20:51:11
  • 766

419. Battleships in a Board(计算甲板上的军舰数)

Given an 2D board, count how many different battleships are in it. The battleships are represented w...
  • xiangwanpeng
  • xiangwanpeng
  • 2016-11-04 13:23:28
  • 960

leetcode oj java Battleships in a Board

一、问题描述: Given an 2D board, count how many different battleships are in it. The battleships are ...
  • u011060119
  • u011060119
  • 2016-11-22 21:03:13
  • 370

419. Battleships in a Board

Given an 2D board, count how many different battleships are in it. The battleships are represented w...
  • lgh1992314
  • lgh1992314
  • 2016-10-24 23:40:48
  • 977

LeetCode 419. Battleships in a Board

Given an 2D board, count how many different battleships are in it. The battleships are represented w...
  • u012385432
  • u012385432
  • 2017-01-03 17:19:48
  • 177

419. Battleships in a Board

题目 Given an 2D board, count how many battleships are in it. The battleships are represented with ‘...
  • ZZLCSDN2017
  • ZZLCSDN2017
  • 2017-02-23 23:43:21
  • 196

【LeetCode】419. Battleships in a Board 解题报告(Python)

【LeetCode】419. Battleships in a Board 解题报告(Python) 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/...
  • fuxuemingzhu
  • fuxuemingzhu
  • 2018-02-28 17:14:21
  • 46

leetcode 419 Battleships in a Board C++

好久不刷leetcode了,因为找了个还比较满意的实习,今天突然上来发现C++都不会写了。。。还是要保持手感呐。 这道题第一思路就是DFS,然而它给了两个要求,一个是不能改变board,第二是只用O...
  • a2331046
  • a2331046
  • 2016-11-27 22:44:59
  • 390

LeetCode - 419. Battleships in a Board

解题代码: classSolution { public:     intcountBattleships(vector>& board) {         int num=0;     ...
  • u014642924
  • u014642924
  • 2017-03-03 17:42:30
  • 100
收藏助手
不良信息举报
您举报文章:LeetCode 419. Battleships in a Board
举报原因:
原因补充:

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