mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 17:50:39 +08:00
fixed some spellings
This commit is contained in:
@ -2,7 +2,7 @@
|
||||
* Author: Samarth Jain
|
||||
* Dijkstra's Algorithm implementation in JavaScript
|
||||
* Dijkstra's Algorithm calculates the minimum distance between two nodes.
|
||||
* It is used to find the shortes path.
|
||||
* It is used to find the shortest path.
|
||||
* It uses graph data structure.
|
||||
*/
|
||||
|
||||
|
@ -2,8 +2,8 @@
|
||||
https://dev.to/rattanakchea/amazons-interview-question-count-island-21h6
|
||||
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.
|
||||
|
||||
two a dimensial grid map
|
||||
each element is going to represent a peice of land
|
||||
a two dimensional grid map
|
||||
each element is going to represent a piece of land
|
||||
1 is land,
|
||||
0 is water
|
||||
output a number which is the number of islands
|
||||
|
Reference in New Issue
Block a user