程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> [LeetCode]Number of Islands

[LeetCode]Number of Islands

編輯:C++入門知識

[LeetCode]Number of Islands


 

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3


 

bfs 主義層之間的互相訪問要遏制。

 

public class Solution {
	
	class Pair{
		int x,y;
		Pair(int x,int y){
			this.x = x;
			this.y = y;
		}
	}
	
    public int numIslands(char[][] grid) {
    	if(grid==null||grid.length==0) return 0;
    	int row = grid.length,column = grid[0].length;
    	int res = 0;
        for(int i=0;i que = new LinkedList<>();
    	que.offer(new Pair(i,j));
    	while(!que.isEmpty()){
    		Pair p= que.poll();
    		grid[p.x][p.y] = '*';
    		if(isIsland(grid, p.x-1, p.y)){
    			//非常重要,防止同層之間互相加
    			grid[p.x-1][p.y] ='*';
    			que.offer(new Pair(p.x-1,p.y));
    		}
    		if(isIsland(grid, p.x+1, p.y)){
    			grid[p.x+1][p.y] ='*';
    			que.offer(new Pair(p.x+1,p.y));
    		}
    		if(isIsland(grid, p.x, p.y-1)){
    			grid[p.x][p.y-1] ='*';
    			que.offer(new Pair(p.x,p.y-1));
    		}
    		if(isIsland(grid, p.x, p.y+1)){
    			grid[p.x][p.y+1] ='*';
    			que.offer(new Pair(p.x,p.y+1));
    		}
    	}
    }
    
    private boolean isIsland(char[][]grid,int i,int j){
    	if(i<0||i>=grid.length||j<0||j>=grid[0].length) return false;
    	if(grid[i][j]=='1') return true;
    	return false;
    }
}
dfs代碼較簡單,但運行時間比bfs慢

 

 

public class Solution {
	
    public int numIslands(char[][] grid) {
    	if(grid==null||grid.length==0) return 0;
    	int row = grid.length,column = grid[0].length;
    	int res = 0;
        for(int i=0;i=grid.length||j<0||j>=grid[0].length) return false;
    	if(grid[i][j]=='1') return true;
    	return false;
    }
}


 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved