BFS
文章平均质量分 51
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
LeetCode | Word Ladder
参考文章:http://blog.csdn.net/yutianzuijin/article/details/12887747Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord原创 2016-08-14 17:32:33 · 250 阅读 · 0 评论 -
LeetCode | Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.For example, X X X X X O O原创 2016-08-14 20:09:49 · 712 阅读 · 0 评论