【题目】原文：1.3 Design an algorithm and write code
to remove the duplicate characters in a string without using any additional
buffer. NOTE: One or two add...
分类：
其他好文 时间：
2014-06-02 21:32:04
阅读次数：
284
Divide two integers without using multiplication, division and mod operator.
不使用乘法、除法和求模运算求两个数相除。...
分类：
其他好文 时间：
2014-06-01 18:16:23
阅读次数：
311
问题：
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens...
分类：
其他好文 时间：
2014-06-01 18:08:28
阅读次数：
334
You are given two linked lists representing two
non-negative numbers. The digits are stored in reverse order and each of their
nodes contain a single ...
分类：
其他好文 时间：
2014-06-01 17:05:44
阅读次数：
296
Merge Sorted ArrayGiven two sorted integer
arrays A and B, merge B into A as one sorted array.Note: You may assume that A
has enough space (size that ...
分类：
其他好文 时间：
2014-06-01 12:04:32
阅读次数：
175
【题目】
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = "great":
great
/ gr eat
/ \ / g r e at
/ ...
分类：
其他好文 时间：
2014-06-01 09:41:05
阅读次数：
196
【题目】
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are...
分类：
其他好文 时间：
2014-06-01 09:21:16
阅读次数：
292
【题目】
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.
...
分类：
其他好文 时间：
2014-06-01 09:16:29
阅读次数：
242
title:
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
翻译：
10以下的质数的和为2 + 3 + 5 + 7 = 17。
请求出200,0000以下所有质数的和。
import math,time
d...
分类：
其他好文 时间：
2014-06-01 09:12:31
阅读次数：
239
【题目】
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2], a solution ...
分类：
其他好文 时间：
2014-06-01 08:51:06
阅读次数：
292
