2013年2月21日
leetcode 84: Word Ladder
摘要： Word LadderFeb 11Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:start="hit"end="cog"dict=[& 阅读全文
posted @ 2013-02-21 07:44 西施豆腐渣 阅读(181) 评论(0) 推荐(0) 编辑
leetcode 83: Wildcard Matching
摘要： Wildcard MatchingMar 16 '12Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string (not partial). The f 阅读全文
posted @ 2013-02-21 04:59 西施豆腐渣 阅读(216) 评论(0) 推荐(0) 编辑