北海_南风

提交代码：class Solution { public void solve(char[][] board) { int m = board.length,lines = 0; if(m != 0){ lines = board[0].length; } for (int x = 0; x < m; x++) { dfs(board,x,0).

提交代码：class Solution { public int maxAreaOfIsland(int[][] grid){ int n = grid.length; int m = grid[0].length; int[] count = new int[1]; int max=0,temp=0; for (int i = 0;i<n;i++){ for (int j = 0;j&.