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...
分类：
其他好文 时间：
2015-06-03 11:56:06
阅读次数：
91
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For ...
分类：
其他好文 时间：
2015-06-02 09:24:48
阅读次数：
113
1 #include 2 using namespace std; 3 int main() 4 {char c; 5 int letters=0,num=0,kongge=0,other=0; 6 while((c=getchar())!='\n') 7 {if ((c>='a' && ...
分类：
其他好文 时间：
2015-05-31 21:31:56
阅读次数：
126
Word Search II问题：Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of s...
分类：
其他好文 时间：
2015-05-31 18:18:22
阅读次数：
117
Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.思路分析：这题主要考察Trie 即前缀树的实现，Trie可以用于字典的压缩存储，可以节省空间，但是不节省时间（和HashSet相比）...
分类：
其他好文 时间：
2015-05-31 14:05:08
阅读次数：
178
If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
If all the numbers from 1 to 1000 (one thousand) inclusive we...
分类：
其他好文 时间：
2015-05-31 12:33:14
阅读次数：
126
题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters...
分类：
其他好文 时间：
2015-05-30 16:35:41
阅读次数：
96
题目：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adj...
分类：
其他好文 时间：
2015-05-29 13:39:20
阅读次数：
117
问题
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 th...
分类：
其他好文 时间：
2015-05-29 10:08:13
阅读次数：
115
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without
repeating letters for "abcabcbb" is "abc", which the length is 3. Fo...
分类：
其他好文 时间：
2015-05-28 19:59:44
阅读次数：
129
