To the Top
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 | 209 Views, 16964 Search Bots | 125 Words

Subscribe to Feed Burner | Browse | Archive
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:

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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 209 Views, 16964 Search Bots | 125 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Min Stack
  2. [Daily Problem] Remove k-th Last Element From Linked List
  3. Algorithm Interview: Permutations of numbers
  4. Daily Interview Problem: Largest Product of 3 Elements I
  5. Daily Interview Question: Find Cycles in a Graph
  6. Absolute Path
  7. Kaprekar
  8. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  9. Progess made
  10. Algorithm Interview: Level Order Traversal of Binary Tree

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />