摘要：
题目链接Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the tele... 阅读全文
posted @ 2014-06-05 22:17
tenos
阅读(3739)
评论(0)
推荐(1)
摘要：
题目链接Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the... 阅读全文
posted @ 2014-06-05 21:00
tenos
阅读(1500)
评论(1)
推荐(1)
摘要：
题目链接Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not pos... 阅读全文
posted @ 2014-06-05 13:01
tenos
阅读(1337)
评论(0)
推荐(0)
摘要：
题目链接 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses con... 阅读全文
posted @ 2014-06-05 12:06
tenos
阅读(859)
评论(0)
推荐(0)
浙公网安备 33010602011771号