public class Solution {
public int countBattleships(char[][] board) {
int m=board.length;
if(m==0)
return 0;
int n=board[0].length;
if(n==0)
return 0;
int count=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
if(board[i][j]=='.')continue;
else if(i>0&&board[i-1][j]=='X')continue;
else if(j>0&&board[i][j-1]=='X')continue;
count++;
}
return count;
}
}
419. Battleships in a Board
最新推荐文章于 2019-11-15 10:14:32 发布