回溯法
柯森锎
92年的小学生
展开
-
LeetCode 10. Regular Expression Matching(hard)
题目描述Implement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.The matching should cover the entire input st原创 2016-09-25 21:22:28 · 353 阅读 · 0 评论 -
LeetCode 17. Letter Combinations of a Phone Number
题目描述Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string "2原创 2016-11-17 22:58:52 · 403 阅读 · 0 评论