2015年2月13日
Leetcode 17 Letter Combinations of a Phone Number - DFS思想
摘要： Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2015-02-13 08:10 Sherry是小太阳 阅读(131) 评论(0) 推荐(0) 编辑
Leetcode 131 Palindrome Partitioning(DFS思路)
摘要： Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2015-02-13 04:33 Sherry是小太阳 阅读(214) 评论(0) 推荐(0) 编辑