2018年6月23日
127. Word Ladder
摘要： Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, 阅读全文
posted @ 2018-06-23 21:57 回到明天 阅读(100) 评论(0) 推荐(0)
542. 01 Matrix
摘要： Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: 阅读全文
posted @ 2018-06-23 12:50 回到明天 阅读(101) 评论(0) 推荐(0)
133. Clone Graph
摘要： Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled 阅读全文
posted @ 2018-06-23 08:34 回到明天 阅读(109) 评论(0) 推荐(0)