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 maximu...
分类：
其他好文 时间：
2014-05-26 18:46:20
阅读次数：
251
PS:接上一篇 本文摘自OSchina Linuxqueen
不幸的是，这样做看上去似乎不太可能。即使是我们有神奇的函数，可以让我们从n遍历到无限大，我们也会在返回第一个值之后卡住：
1
def get_primes(start):
2
for element in magical_infinite_ra...
分类：
编程语言 时间：
2014-05-26 04:07:40
阅读次数：
366
题目：2520 is the smallest number that can be
divided by each of the numbers from 1 to 10 without any remainder.What is the
smallest positive number that...
分类：
其他好文 时间：
2014-05-26 02:12:53
阅读次数：
167
致谢原文： 通过ID得到element： Document.getElementById(id
string) 返回element object, 如果失败，得到null
注意id在页面内应该是唯一的，但在iframe的看作是另一个html页面通过TagName得到element ...
分类：
Web程序 时间：
2014-05-26 00:08:18
阅读次数：
679
原文：
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without ...
分类：
其他好文 时间：
2014-05-25 21:30:02
阅读次数：
276
Remove Duplicates from Sorted ArrayGiven a
sorted array, remove the duplicates in place such that each element appear only
once and return the new len...
分类：
其他好文 时间：
2014-05-25 19:08:31
阅读次数：
203
寻找图中最小连通的路径，图如下：
算法步骤：
1. Sort all the edges in non-decreasing order of their weight.
2. Pick the smallest edge. Check if it forms a cycle with the spanning tree
formed so far. If cycle is n...
分类：
其他好文 时间：
2014-05-25 07:35:59
阅读次数：
301
1 - Tomcat Server的组成部分
1.1 - Server
A Server element represents the entire Catalina servlet container. (Singleton)
1.2 - Service
A Service element represents the combination of one or more Con...
分类：
其他好文 时间：
2014-05-25 07:10:23
阅读次数：
278
【题目】
The set [1,2,3,…,n] contains a total of n! unique permutations.
By listing and labeling all of the permutations in order,
We get the following sequence (ie, for n = 3):
"123"
"132"
"213"
"231"
"312"
"321"
Given n and k, return the kth permutation ...
分类：
其他好文 时间：
2014-05-25 06:13:37
阅读次数：
276
【题目】
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
