2014年9月15日

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 telepho 阅读全文

posted @ 2014-09-15 22:55 bug睡的略爽 阅读(188) 评论(0) 推荐(0) 编辑

Integer to Roman

摘要： Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 普及一下罗马计数法 The base I - 1 V - 5 X - 10 L - 阅读全文

posted @ 2014-09-15 22:23 bug睡的略爽 阅读(164) 评论(0) 推荐(0) 编辑

Regular Expression Matching

摘要： Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding elemen 阅读全文

posted @ 2014-09-15 20:45 bug睡的略爽 阅读(189) 评论(0) 推荐(0) 编辑

String to Integer (atoi)

摘要： Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below 阅读全文

posted @ 2014-09-15 15:27 bug睡的略爽 阅读(143) 评论(0) 推荐(0) 编辑

Add Two Numbers

摘要： You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single 阅读全文

posted @ 2014-09-15 11:11 bug睡的略爽 阅读(169) 评论(0) 推荐(0) 编辑

导航