Given an arraySofnintegers, are there
elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in
the array which gives the sum of ...
分类：
其他好文 时间：
2014-05-26 13:56:05
阅读次数：
269
which gem
在这篇文章里，我们将学到
1. 怎么用Rails来生成我们的第一个app。
2. 学会怎么使用Git进行版本控制。
3.怎么将程序部署至Heroku，Rails服务提供商。
Ruby on Rails是一个最流行、最强大的构建动态网站的一个框架。有很多知名的企业使用Rails，例如：
37signal、Github、Shopify、Scribd、Twitter、Di...
分类：
其他好文 时间：
2014-05-26 05:37:07
阅读次数：
389
题目一：
Given a binary tree containing digits from 0-9 only, each root-to-leaf
path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Fin...
分类：
其他好文 时间：
2014-05-26 04:06:41
阅读次数：
248
The Jordan 6 Carmine have inclination is easily
the most popular release of year. Which is without being aware of what other
shoes are likely to relea...
分类：
其他好文 时间：
2014-05-26 02:40:58
阅读次数：
273
Pick applesTime Limit: 1000MS Memory limit:
165536K题目描写叙述Once ago, there is a mystery yard which only produces three kinds
of apples. The number of ea...
分类：
移动开发 时间：
2014-05-26 00:24:52
阅读次数：
443
The Leak of the Memory in C++
In this chaper I will introduce a new smart pointer which is scoped_ptr;
It likes auto_ptr but better. When peopel use auto_ptr, sometimes they forget
that auto_...
分类：
编程语言 时间：
2014-05-25 07:03:10
阅读次数：
373
题目:
Given an array S of n integers, are there elements a, b, c in S such that a + b + c =
0? Find all unique
triplets in the array which gives the sum of zero.
Note:
Elements...
分类：
其他好文 时间：
2014-05-25 00:39:37
阅读次数：
343
【题目】
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] has the largest sum = 6.
【题意】
给定一个数组，找出和最大的子数组，返回...
分类：
其他好文 时间：
2014-05-24 22:19:17
阅读次数：
260
A bit is a binary digit, taking a logical value of either 1 or 0 (also referred to as "true" or "false" respectively). And every decimal number has a binary representation which is actually a series o...
分类：
其他好文 时间：
2014-05-24 17:19:41
阅读次数：
335
Given a string S and a string T, find the
minimum window in S which will contain all the characters in T in complexity
O(n).For example, S = "ADOBECOD...
