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...
分类：
其他好文 时间：
2015-07-07 19:36:09
阅读次数：
152
Design a data structure that supports the following two operations:void addWord(word)
bool search(word)
search(word) can search a literal word or a regular expression string containing only letters a...
分类：
其他好文 时间：
2015-07-06 21:48:08
阅读次数：
104
1.Identifers命名规则Identifers is combined with letters, underline, dollars, numbersmust begin with letters, underline,dollars.2.keyword 保留字3.OC常量int cons...
分类：
移动开发 时间：
2015-07-06 19:32:48
阅读次数：
199
Problem Description
Now you are back,and have a task to do:
Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-string of s.
And you have som...
分类：
编程语言 时间：
2015-07-05 23:58:10
阅读次数：
557
Q:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters ...
分类：
其他好文 时间：
2015-07-05 16:41:08
阅读次数：
97
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-07-04 15:14:10
阅读次数：
107
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 st...
分类：
其他好文 时间：
2015-07-04 14:02:10
阅读次数：
282
Implement a trie with insert, search, and startsWith methods.Note:
You may assume that all inputs are consist of lowercase letters a-z.Hide Tags Data Structure Trie实现一棵Trie树以及实现查询的功能，根据上一篇文章中的分析和伪代码可以...
分类：
其他好文 时间：
2015-07-03 17:35:14
阅读次数：
111
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 “adjacent” cells are those horizontally or vertically neig...
分类：
其他好文 时间：
2015-07-02 17:40:27
阅读次数：
95
Implement a trie with insert, search, and startsWith methods.
Note:
You may assume that all inputs are consist of lowercase letters a-z.
前缀查找树，简单的可以实现为一种26叉树。需要在节点上增加一个字段，标明该节点是否是一个单词，还是仅仅是单词的前缀。代码...
分类：
其他好文 时间：
2015-06-27 16:26:34
阅读次数：
142
