Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2014-12-15 00:00:53
阅读次数：
329
#include
#include
#include
#include
#define MAX_LETTERS 27
#define MAX_CHAR 30//字符串的长度
typedef enum {data,pointer}node_type;
typedef struct trie_node *trie_pointer;
struct trie_node...
分类：
其他好文 时间：
2014-12-12 19:14:17
阅读次数：
171
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...
分类：
其他好文 时间：
2014-12-12 11:49:07
阅读次数：
132
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...
分类：
其他好文 时间：
2014-12-11 22:33:05
阅读次数：
403
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类：
其他好文 时间：
2014-12-11 00:12:47
阅读次数：
297
#coding:gbkimportrandomimportstringimportredefnumx():while1:#t=re.compile(r'[a-z0-9A-Z]')n=''.join(random.sample(string.letters+string.digits,4)).stri...
分类：
其他好文 时间：
2014-12-10 22:36:28
阅读次数：
377
SELECT sum(value) FROM invoice where username='yueer'SELECT count(letters) FROM invoice where username='yueer'如果yueer这个用户名不存在，第一个会返回null值，第二个会返回0
分类：
数据库 时间：
2014-12-09 12:00:24
阅读次数：
231
问题描述：
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:Dig...
分类：
其他好文 时间：
2014-12-08 23:03:54
阅读次数：
243
在矩阵中查找给定的单词是否出现，可以向上、向下、向左和向右查找。不能在一个字母上重复查找。
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 "a...
分类：
编程语言 时间：
2014-12-08 21:23:30
阅读次数：
420
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2014-12-08 21:07:17
阅读次数：
128
