zoukankan      html  css  js  c++  java
  • Leetcode: Battleships in a Board

    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.
    Follow up:
    Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?

    只计算每个battleship的第一个元素,所以后面‘X’如果above或者left也是'X'的话,不被计算

     1 public class Solution {
     2     public int countBattleships(char[][] board) {
     3         if (board==null || board.length==0 || board[0].length==0) return 0;
     4         int count = 0;
     5         for (int i=0; i<board.length; i++) {
     6             for (int j=0; j<board[0].length; j++) {
     7                 if (board[i][j]=='X' && (i==0 || board[i-1][j]!='X') && (j==0 || board[i][j-1]!='X')) 
     8                     count++;
     9             }
    10         }
    11         return count;
    12     }
    13 }
  • 相关阅读:
    HDU 2553 N皇后问题
    HDU 2553 N皇后问题
    HDU 1045 Fire Net
    HDU 1045 Fire Net
    HUD 1175 连连看
    HUD 1175 连连看
    poj3190 Stall Reservations (贪心+优先队列)
    poj3190 Stall Reservations (贪心+优先队列)
    ThinkPHP 模板截取字符串 【转载】
    鼠标位置距浏览器窗体距离
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/6132577.html
Copyright © 2011-2022 走看看