原题地址：https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/题意：
1 / \ 2 3 / \ / \ 4 5 6 7变为： ...
分类：
编程语言 时间：
2014-05-26 23:43:29
阅读次数：
332
原题地址：https://oj.leetcode.com/problems/copy-list-with-random-pointer/题意：A
linked list is given such that each node contains an additional random pointe...
分类：
编程语言 时间：
2014-05-26 23:16:12
阅读次数：
368
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
Features 256 bits EEPROM memory organized in 8
pages of 32 bits each 32 bits unique factory programmed serial number Typical
operating frequency : ...
分类：
其他好文 时间：
2014-05-26 13:32:43
阅读次数：
287
用focus设置输入光标的时候，默认情况下，在IE，谷歌浏览器，苹果（safari）浏览器下是在输入框的最前面，在火狐，opera下是在输入框的文字最后面。如果想自己设置，下面有两个jquery的扩展，可供参考。$.fn.focusEnd=function(){
return this.each(f...
分类：
其他好文 时间：
2014-05-26 09:29:06
阅读次数：
219
题目一：
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
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have
exact...
分类：
其他好文 时间：
2014-05-25 00:46:51
阅读次数：
229
【题目】
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example:...
分类：
其他好文 时间：
2014-05-24 20:44:39
阅读次数：
221
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume
that each input would have exact...
分类：
其他好文 时间：
2014-05-24 20:43:37
阅读次数：
341
import re
data = open('a.txt')
fh = open('b.txt', 'w')
"""Search the string begining with '【'"""
p = re.compile(r'\s*[\u3010]')
for each_d in data:
if re.match('\s*3\d{4}', each_d):
...
分类：
编程语言 时间：
2014-05-22 17:26:17
阅读次数：
293
