Max Area of Island

Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

Find the maximum area of an island in the given 2D array. (If there is no island, the maximum area is 0.)

解析:就是给个二维数组,让我们找到最大的一块连着的区域,用深度优先搜索,判断一个区域的四周,看还有没有1,有的话就继续遍历四周,直到遍历完,

注意,每遍历一个就把它设为0,防止又遍历一遍.

import javax.swing.plaf.basic.BasicInternalFrameTitlePane.MaximizeAction;

public class Solution {
    public int maxAreaOfIsland(int[][] grid) {
    	int max_num = 0;
    	int result;
    	for(int i = 0; i < grid.length;i++)
    		for(int j = 0; j < grid[i].length; j++){
    			if(grid[i][j] == 1){
    				result = dfs(grid ,i,j);
    				
    				if(max_num < result){
        				max_num = result;
        			}		
    			}
    				
    		} 
    	
    	
       return max_num;
    }
    public int dfs(int[][] grid, int i, int j)
         {
             // if i or j is invalid or grid is 0, just return 0
             if( i < 0 || i >= grid.length || j < 0 || j >= grid[0].length || grid[i][j] == 0)
                return 0;
             
             // do dfs to its 4 direction cell when value is 1
             int tempMaxArea = 1;    
             grid[i][j] = 0; // set current cell to 0 to prevent dfs coming back
            
           // order is left, top, right, bottom
             tempMaxArea += dfs(grid, i, j-1) + dfs(grid, i-1, j) + dfs(grid, i, j+1) + dfs(grid, i+1, j);
           
            return tempMaxArea;
    }
    public static void main(String args[]){
    	int[][] a = {{0,0,1,0,0,0,0,1,0,0,0,0,0},
    	             {0,0,0,0,0,0,0,1,1,1,0,0,0},
    	             {0,1,1,0,1,0,0,0,0,0,0,0,0},
    	             {0,1,0,0,1,1,0,0,1,0,1,0,0},
    	             {0,1,0,0,1,1,0,0,1,1,1,0,0},
    	             {0,0,0,0,0,0,0,0,0,0,1,0,0},
    	             {0,0,0,0,0,0,0,1,1,1,0,0,0},
    	             {0,0,0,0,0,0,0,1,1,0,0,0,0}};
    	Solution s = new Solution();
    	System.out.println(s.maxAreaOfIsland(a));
    	
    }
    
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值