码迷,mamicode.com
首页 > 其他好文 > 详细

419. Battleships in a Board

时间:2017-09-01 11:52:32      阅读:209      评论:0      收藏:0      [点我收藏+]

标签:memory   man   modifying   col   other   empty   boa   leshi   follow   

Given an 2D board, count how many 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.

 

Follow up:
Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?

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;
    }
};

 

419. Battleships in a Board

标签:memory   man   modifying   col   other   empty   boa   leshi   follow   

原文地址:http://www.cnblogs.com/wujufengyun/p/7462424.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!