Given a NxN matrix with values X and O where X represent land and O represent water find the number of islands. Two consecutive X X (horizontal or vertical) will be part of single island while diagonal X X are not. (Solve using graph - DFS or BFS with Queue)
public class Solution { public int numberOfIslands(char[][] m) { int count = 0; if (m == null || m.length == 0 || m[0].length == 0) { return count; } for (int i = 0; i < m.length; i++) { for (int j = 0; j < m[0].length; j++) { if (m[i][j] == 'X') { count++; helper(m, i, j); } } } return count; } private void helper(char[][] m, int x, int y) { if (x < 0 || y < 0 || x >= m.length || y >= m[0].length || m[x][y] == 'L' || m[x][y] == 'O') { return; } m[x][y] = 'L'; helper(m, x + 1, y); helper(m, x - 1, y); helper(m, x, y + 1); helper(m, x, y - 1); } public static void main(String[] args) { Solution s = new Solution(); char[][] m = { {'X', 'X', 'X', 'O', 'O'}, {'O', 'O', 'O', 'X', 'X'}, {'O', 'O', 'O', 'X', 'X'}, {'O', 'O', 'X', 'O', 'O'}, {'O', 'O', 'O', 'X', 'X'}, {'X', 'O', 'X', 'O', 'O'}, {'X', 'X', 'X', 'O', 'O'} }; System.out.println(s.numberOfIslands(m)); } }
相关推荐
The number of questions is increasing recently. Here is the classification of all `468` questions. For more questions and solutions, you can see my [LintCode](https://github.com/kamyu104/LintCode) ...
lru缓存leetcode 力扣_30天 力扣 30 天挑战赛 日 问题描述 问题和解决方案链接 Git 解决方案页面 1 SINGLE NUMBER 2 HAPPY NUMBER 3 MAXIMUM SUBARRAY 4 Move Zeroes ...of ...of ...of ...Number of Islands 18 M
Islands:DFS My Calendar II:小空间匹配 My Calendar I:同上 *732. My Calendar III:难,小数据量可以用线段匹配,大数据量要用LCT(但是这东西看不懂) Construct String from Binary Tree:中序遍历 Word Ladder...
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. Input:...
Number of Islands], BFS 2017.06.14 打卡[LeetCode 3. Longest Substring Without Repeating Characters], N/A 2017.06.15 打卡[LeetCode 407. Trapping Rain Water II], BFS/Priority queue 2017.06.19 打卡...
狼人问题leetcode 不同岛屿的数量 给定一个由 0 和 1 组成的非空 2D 阵列网格,岛是一组 1(代表陆地)以 ...个方向(水平或垂直)连接。您可以假设网格的所有四个边缘都被水包围。...当且仅当一个岛可以平移(而不是旋转...
题目 给定一个由 ‘1’(陆地)和 ...链接:https://leetcode-cn.com/problems/number-of-islands 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。 思路 用宽度优先搜索思想,将一个根节点(取
(11.7 million sq mi) including adjacent islands, it covers 6% of the Earth's total surface area and 20.4% of the total land area.[2] With 1.0 billion people (as of 2009, see table) in 65 territories ...
and the Graduate School of the University of Oregon in partial fulfillment of the requirements for the degree of Master of Science March 2009 11 "Effectiveness of Extracting Water Surface Slopes from ...
Chapter 35: The Math, Number, and Boolean Objects. Chapter 36: The Date Object. Chapter 37: The Array Object. Chapter 38: The Regular Expression and RegExp Objects. Chapter 39: Control Structures ...
** 列表实现岛屿数量(DFS+BFS) ** 给定一个由 ‘1’(陆地)和 ‘0’(水)...链接:https://leetcode-cn.com/problems/number-of-islands 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/number-of-islands 示例 1: 输入: 11110 11010 11000 00000 输出: 1 示例 2: 输入: 11000 11000 00100 00011 输出: 3 解释: 每座岛屿只能由水平和/...