const char* lookup[] = {" ", "", "abc", "def",
"ghi", "jkl", "mno", "pqrs", "tuv", "wxy...
分类：
其他好文 时间：
2014-06-07 05:04:11
阅读次数：
192
Given a collection of candidate numbers (C) and
a target number (T), find all unique combinations inCwhere the candidate numbers
sums toT.Each number ...
分类：
其他好文 时间：
2014-05-26 13:59:59
阅读次数：
237
Given a set of candidate numbers (C) and a
target number (T), find all unique combinations inCwhere the candidate numbers
sums toT.Thesamerepeated num...
分类：
其他好文 时间：
2014-05-26 13:54:25
阅读次数：
282
??
1、Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter...
分类：
其他好文 时间：
2014-05-26 05:03:19
阅读次数：
172
using recursive and bitwise methods to get
string combinations.
分类：
其他好文 时间：
2014-05-25 12:26:56
阅读次数：
187
判断二维字符串是否满足下面条件：
on both diagonals of the square paper all letters are the same;
all other squares of the paper (they are not on the diagonals) contain the same letter that is different from the...
分类：
其他好文 时间：
2014-05-23 02:21:01
阅读次数：
294
#include
#include
#include //system(); 这个指令需要用到此头文件
#include //toupper要用到
#include //在内存管理时用到的头文件
void main()
{
char letter; // Letter typed by the user
printf("Do you want to continue? (...
分类：
其他好文 时间：
2014-05-22 06:18:00
阅读次数：
340
【题目】
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
All numbers (including target) will be ...
分类：
其他好文 时间：
2014-05-21 15:55:25
阅读次数：
259
【题目】
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
All numbers (including target) w...
分类：
其他好文 时间：
2014-05-21 15:21:28
阅读次数：
292
参考别人的code, 看似不难的题，其实挺费事的。思想还是：From this example, we
can see that in the first position of the resulting combinations we can chose
number 1-5. Assume t...
分类：
其他好文 时间：
2014-05-21 14:24:04
阅读次数：
241
