File: root - text - article - 2019 - 12 - find-the-number-of-islands.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 211 Views, 17172 Search Bots | 125 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 211 Views, 17172 Search Bots | 125 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by LinkedIn:
Given a 2-dimensional grid consisting of 1's (land blocks) and 0's (water blocks), count the number of islands present in the grid. The definition of an island is as follows:
1.) Must be surrounded by water blocks.
2.) Consists of land blocks (1's) connected to adjacent land blocks (either vertically or horizontally).
Assume all edges outside of the grid are water.
Example:
Input:
Output: 3
Here's your starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 211 Views, 17172 Search Bots | 125 Words Given a 2-dimensional grid consisting of 1's (land blocks) and 0's (water blocks), count the number of islands present in the grid. The definition of an island is as follows:
1.) Must be surrounded by water blocks.
2.) Consists of land blocks (1's) connected to adjacent land blocks (either vertically or horizontally).
Assume all edges outside of the grid are water.
Example:
Input:
10001
11000
10110
00000
Output: 3
Here's your starting point:
class Solution(object):
def inRange(self, grid, r, c):
numRow, numCol = len(grid), len(grid[0])
if r < 0 or c < 0 or r >= numRow or c >= numCol:
return False
return True
def numIslands(self, grid):
# Fill this in.
grid = [[1, 1, 0, 0, 0],
[0, 1, 0, 0, 1],
[1, 0, 0, 1, 1],
[0, 0, 0, 0, 0]]
print(Solution().numIslands(grid))
# 3
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Queue Using Two Stacks
- Fix Brackets
- ImageMagick Vulnerabilities - CVE-2016–3714
- Daily Interview Problem: Sort Colors
- Algorithm Interview: Shifted String
- Making a Height Balanced Binary Search Tree
- A trick for getting good at coding interviews FASTER
- Daily Interview Problem: Arithmetic Binary Tree
- Daily Interview Problem: Look and Say Sequence
- Daily Interview Problem: Merge List Of Number Into Ranges
©2006~2024 SteakOverCooked - 0.0101 Seconds(s) - 3524.73 KB/s - 14 Online
Memory: 527.74 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !