BFS
katrina95
这个作者很懒,什么都没留下…
展开
-
LeetCode 1091. Shortest Path in Binary Matrix
In an N by N square grid, each cell is either empty (0) or blocked (1).A clear path from top-left to bottom-right has length k if and only if it is composed of cells C_1, C_2, …, C_k such that:Adjac...原创 2019-06-16 13:47:59 · 576 阅读 · 0 评论 -
Leetcode 127. Word Ladder(java)
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a tim...原创 2019-07-05 08:27:33 · 257 阅读 · 0 评论 -
LeetCode 126. Word Ladder II
Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a timeEach ...原创 2019-07-05 10:24:35 · 93 阅读 · 0 评论 -
LeetCode 815. Bus Routes(java)
We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels in the sequenc...原创 2019-09-09 09:34:47 · 490 阅读 · 0 评论