本文共 405 字，大约阅读时间需要 1 分钟。

419. 甲板上的战舰

class Solution {
   public:    int countBattleships(vector
   
    
     >& board) {
           int R = board.size(), C = board[0].size(), res = 0;        for (int i = 0; i < R; ++i)            for (int j = 0; j < C; ++j)                if (board[i][j] == 'X' &&                     (!i || board[i - 1][j] == '.') && (!j || board[i][j - 1] == '.'))                    ++res;        return res;    }};
    
   

转载地址：http://dbmki.baihongyu.com/