Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, whe...
分类：
其他好文 时间：
2014-06-09 23:14:45
阅读次数：
264
描述：
用户点击左边div中的商品，对应商品会自动添加到右面的div中，类似电子商城中的添加到购物车功能。
主要用到了jquery中的复制节点功能，基本原理是首先获取点击的元素，然后将相应信息进行克隆，然后添加到右面的div中。
show you code:
jquery test
.left
{
float: left;
width: 500px;
heigh...
分类：
Web程序 时间：
2014-06-08 18:01:23
阅读次数：
253
【题目】
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum from top to...
分类：
其他好文 时间：
2014-06-08 17:52:45
阅读次数：
235
我们在浏览一些网站，尤其是一些小说网站的时候，都会有修改页面背景颜色的地方，这个功能使用jquery很容易实现。
效果图：
show you code:
jquery test
white
red
green
yellow
$("button").click(
function()
{
var color = this.value;
$("...
分类：
Web程序 时间：
2014-06-08 16:48:45
阅读次数：
274
【题目】
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
You may only use constant extra space.
For example,
Given the following binary tre...
分类：
其他好文 时间：
2014-06-08 15:46:22
阅读次数：
303
【题目】
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
【题意】
给定行索引k, k从0开始，返回该索引指向的杨辉三角的行
要求只能使用O(k)的额外空间
【思路】
...
分类：
其他好文 时间：
2014-06-08 15:46:02
阅读次数：
272
题目
Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
Note:
A solution using O(n)
space is pretty straight forward. Cou...
分类：
其他好文 时间：
2014-06-08 15:32:45
阅读次数：
245
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.
You should pack your words in a greedy approach; that i...
分类：
编程语言 时间：
2014-06-08 15:25:00
阅读次数：
282
【题目】
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
...
分类：
其他好文 时间：
2014-06-08 15:11:58
阅读次数：
298
Definition
Let be "0" and
be "01". Now (the concatenation of the previous sequence and the one before that).
The infinite Fibonacci word is the limit
We have:
0
01
010
01...
分类：
其他好文 时间：
2014-06-08 09:19:42
阅读次数：
273
