Timeline for Leetcode: Number of Islands - BFS (Queue vs Recursion)
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 23 at 5:07 | history | edited | mdfst13 | CC BY-SA 4.0 |
added 33 characters in body
|
May 18 at 21:45 | comment | added | Alexander Ivanchenko |
@G.Sliepen Sure, agree, in a general case ArrayDeque 's elements will occupy two subarrays. Amended.
|
|
May 18 at 21:43 | history | edited | Alexander Ivanchenko | CC BY-SA 4.0 |
added 44 characters in body
|
May 18 at 19:37 | vote | accept | ccot | ||
May 18 at 19:36 | comment | added | ccot | @Alexander thanks for the detailed feedback, very informative. Concerning code structure, yes I will be moving the BFS using queue code (and other) to their own method. Concerning naming for 'bfs' absolutely, that function as mentioned in the code is copied from another user just to see why it is faster than the queue one, I didn't change its naming for testing, but you are right it should have another naming. | |
May 18 at 17:54 | comment | added | G. Sliepen |
The elements of ArrayDeque are not all contiguous, as that would prohibit fast insertions at the head. However, it is much better at keeping things contiguous and compact in memory than a LinkedList .
|
|
May 18 at 16:41 | history | edited | Alexander Ivanchenko | CC BY-SA 4.0 |
deleted 2 characters in body
|
May 18 at 16:31 | history | edited | Alexander Ivanchenko | CC BY-SA 4.0 |
added 1 character in body
|
May 18 at 15:20 | history | edited | Alexander Ivanchenko | CC BY-SA 4.0 |
added 1 character in body
|
May 18 at 15:10 | history | answered | Alexander Ivanchenko | CC BY-SA 4.0 |