Skip to content

200. Number of Islands #51

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 7, 2019
Merged

200. Number of Islands #51

merged 1 commit into from
Jan 7, 2019

Conversation

zwfang
Copy link
Collaborator

@zwfang zwfang commented Jan 7, 2019

https://leetcode.com/problems/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.

@zwfang zwfang added Medium Coefficient of difficulty medium BFS breadth-first search is an algorithm for traversing or searching tree or graph data structure. DFS Depth-first search is an algorithm for traversing or searching tree or graph data structure. labels Jan 7, 2019
@codecov
Copy link

codecov bot commented Jan 7, 2019

Codecov Report

Merging #51 into master will increase coverage by 0.01%.
The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff            @@
##           master     #51      +/-   ##
=========================================
+ Coverage   99.39%   99.4%   +0.01%     
=========================================
  Files          91      92       +1     
  Lines        1627    1651      +24     
=========================================
+ Hits         1617    1641      +24     
  Misses          6       6              
  Partials        4       4
Impacted Files Coverage Δ
src/0200_number_of_island/number_of_island.go 100% <100%> (ø)

@zwfang zwfang merged commit 009f159 into master Jan 7, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
BFS breadth-first search is an algorithm for traversing or searching tree or graph data structure. DFS Depth-first search is an algorithm for traversing or searching tree or graph data structure. Medium Coefficient of difficulty medium
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant