zoukankan      html  css  js  c++  java
  • 419. 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?

     FOLLOW UP

        //little tricky way only care about the left and up case
        public int countBattleships(char[][] board) {
           if(board == null || board.length == 0) return 0;
           int row = board.length;
           int col = board[0].length;
           int res = 0;
           for(int i = 0; i < row ; i++){
               for(int j = 0; j < col ; j++){
                   if(board[i][j] == 'X'){
                       if(i > 0 && board[i-1][j] == 'X') continue;
                       if(j > 0 && board[i][j-1] == 'X') continue;
                       res++;
                   }
               }
           }
           return res;
        
        }

    DFS

    public class Solution {
        public int countBattleships(char[][] board) {
           if(board == null || board.length == 0) return 0;
           int row = board.length;
           int col = board[0].length;
           int res = 0;
           for(int i = 0; i < row ; i++){
               for(int j = 0; j < col ; j++){
                   if(board[i][j] == 'X'){
                       dfs(board , i, j);
                       res++;
                   }
               }
           }
           return res;
        }
        public void dfs(char[][] board, int i, int j){
            if(i < 0 || i >= board.length || j < 0 || j >=board[0].length || board[i][j] == '.'){
                return;
            }
            board[i][j] = '.';
            dfs(board , i+1, j);
            dfs(board , i, j+1);
            dfs(board , i-1, j);
            dfs(board , i, j-1);
        }
    }
  • 相关阅读:
    postman简单传参,上个接口的返回值作为下个接口的入参。
    python 给定URL 如何获取其内容,并将其保存至HTML文档。
    外键关联on_delete参数含义
    excel导入与导出
    序列化关系
    使用框架的各种代码示例
    国产celery简单使用
    selecte_related 函数优化查询
    django 之 配置文件
    类与缓存问题 类与属性的关系
  • 原文地址:https://www.cnblogs.com/joannacode/p/6108135.html
Copyright © 2011-2022 走看看