Group of 1s in a Matrix

Given a matrix with 1s and 0s, please find the number of groups of 1s. A group is defined by horizontally or vertically adjacent 1s. For example, there are four groups of 1s in figure below.


Analysis: Use DFS.

public class NumberOfGroups {
	
	public static void main(String[] args) {
		int[][] input = {{1, 1, 0, 1, 1}, {1, 0 ,0 , 1, 0}, {1, 1, 1, 1, 0}, {0, 0, 1, 0, 0}};
		System.out.println(new NumberOfGroups().getNumberofGroups(input));
	}
	
	public int getNumberofGroups(int[][] input) {
		boolean[][] visited = new boolean[input.length][input[0].length];
		int count = 0;
		for (int i = 0; i < input.length; i++) {
			for (int j = 0; j < input[0].length; j++) {
				if (input[i][j] == 1 && visited[i][j] == false) {
					count++;
					traverse(input, visited, i, j);
				}
			}
		}
		return count;
	}
	
	public void traverse(int[][] input, boolean[][] visited, int i, int j) {
		if (i < 0 || i >= input.length || j < 0 || j >= input[0].length 
				|| visited[i][j] == true || input[i][j] == 0) return;
		visited[i][j] = true;
		traverse(input, visited, i - 1, j);
		traverse(input, visited, i + 1, j);
		traverse(input, visited, i, j - 1);
		traverse(input, visited, i, j + 1);
	}
}
blog.csdn.net/beiyetengqing



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值