Need help with leetcode problem: 2812. Find the Safest Path in a Grid

Правка en1, от apjcoder123, 2025-02-01 23:14:55

Hi community, I've come across this problem: https://leetcode.com/problems/find-the-safest-path-in-a-grid/description/

Issue: I've come across a solution to this problem where we can apply modified Dijkstra's algo and also transition to 0-1 BFS method Solution link: https://leetcode.com/problems/find-the-safest-path-in-a-grid/solutions/5158996/c-rust-o-n-2-no-dijkstra-pure-bfs-explained-beats-97-44

But I'm unable to understand how is the Queue being Monotonic here in the solution provided in above link.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский apjcoder123 2025-02-01 23:15:35 76
en1 Английский apjcoder123 2025-02-01 23:14:55 588 Initial revision (published)