https://blog.youkuaiyun.com/thumb3344zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/thumb3344/article/details/8087248https://blog.youkuaiyun.com/thumb3344/article/details/8087248thumb3344Thu, 18 Oct 2012 20:33:09 +0800https://blog.youkuaiyun.com/thumb3344/article/details/7005610https://blog.youkuaiyun.com/thumb3344/article/details/7005610thumb3344Sat, 03 Dec 2011 12:02:26 +0800> ~/.bashrc. ~/.bashrc 4. 安装依]]>https://blog.youkuaiyun.com/thumb3344/article/details/6752628https://blog.youkuaiyun.com/thumb3344/article/details/6752628thumb3344Tue, 06 Sep 2011 10:53:27 +0800https://blog.youkuaiyun.com/thumb3344/article/details/6713126https://blog.youkuaiyun.com/thumb3344/article/details/6713126thumb3344Tue, 23 Aug 2011 21:44:55 +0800https://blog.youkuaiyun.com/thumb3344/article/details/5878905https://blog.youkuaiyun.com/thumb3344/article/details/5878905thumb3344Sun, 12 Sep 2010 12:13:00 +0800早上扫了几眼JDBC规范中的Connection,Statement,ResultSet对象，发现了许多小细节。记录于下：
 
按照scope从小到大排列依次是
 
ResultSet，Statement，Connection
 
因此，
隐式关闭 ：
调用conn.close()将使该conn产生的所有statement对象关闭，调用stmt.close将其产生的rs对象关闭。所有引用ResultSet资源的对象]]>https://blog.youkuaiyun.com/thumb3344/article/details/5861292https://blog.youkuaiyun.com/thumb3344/article/details/5861292thumb3344Fri, 03 Sep 2010 13:51:00 +0800注：通篇全是我从不同文章里抄得。 包括：popkiler的博客和丹尼的博客
 
算法的时间性能分析
 
一个算法所耗费的时间=算法中每条语句执行时间之和
其中，算法中每条语句执行时间=语句频度*执行所需的单位时间。如果一条语句执行时间为单位时间，那么程序执行时间就是所有语句的频度之和。可以看出程序性能的取决于机器指令的性能、速度和编译器产生的代码质量有关。
 
O(1):
 
 tmp=m;m=n;n=tm]]>https://blog.youkuaiyun.com/thumb3344/article/details/5860200https://blog.youkuaiyun.com/thumb3344/article/details/5860200thumb3344Fri, 03 Sep 2010 00:19:00 +0800问题：
Check whether a given number n > 1 is prime.
解答：
1.
def isPrime(n): for i in range(2, int(pow(n, 0.5))): if n % i == 0: return False return True
2.筛选法
import random ]]>https://blog.youkuaiyun.com/thumb3344/article/details/5860138https://blog.youkuaiyun.com/thumb3344/article/details/5860138thumb3344Fri, 03 Sep 2010 00:00:00 +0800问题：
Write a program that points the factorization of a given integer n > 0.(In other words, it should print prime numbers whose product is equal to n;if n=1, nothing should be printed)
解答：
1.
 k=n while k!=1: t = 2 whil]]>https://blog.youkuaiyun.com/thumb3344/article/details/5860123https://blog.youkuaiyun.com/thumb3344/article/details/5860123thumb3344Thu, 02 Sep 2010 23:48:00 +0800问题：
Write a program that point the squares of  the natural number 0,1,...,n.
解答：
1.
 
 k=0 while not (k>n): print k*k k=k+1
2.(n-1)2=n2-2n+1则n2=(n-1)2+2n-1
k=0 while not (k>n): k=k+1 square = s]]>https://blog.youkuaiyun.com/thumb3344/article/details/5859192https://blog.youkuaiyun.com/thumb3344/article/details/5859192thumb3344Thu, 02 Sep 2010 16:33:00 +0800问题：
Two nonnegative integers a and b are not both zero. Compute GCD(a,b), the greatest common divisor of a and b.
解答：
1.
k = max(a,b) while not (a%k==0 and b%k==0): k = k-1
2.Euclid's algorithm
m,n=a,b while not ]]>https://blog.youkuaiyun.com/thumb3344/article/details/5858091https://blog.youkuaiyun.com/thumb3344/article/details/5858091thumb3344Thu, 02 Sep 2010 12:53:00 +0800问题：
非负数n，求1/0!+1/1!+...+1/n!。
解答：
1
k,a,sum=N,1,0 while k>0: k=k-1 a=a*k sum=sum+1/a]]>https://blog.youkuaiyun.com/thumb3344/article/details/5856943https://blog.youkuaiyun.com/thumb3344/article/details/5856943thumb3344Thu, 02 Sep 2010 00:06:00 +0800https://blog.youkuaiyun.com/thumb3344/article/details/5856896https://blog.youkuaiyun.com/thumb3344/article/details/5856896thumb3344Wed, 01 Sep 2010 23:46:00 +08000: sum = sum*k k = k-1]]>https://blog.youkuaiyun.com/thumb3344/article/details/5856873https://blog.youkuaiyun.com/thumb3344/article/details/5856873thumb3344Wed, 01 Sep 2010 23:31:00 +0800问题：
有非负数a,和正数d，求商q和余数r？两者的英文单词又是什么？不能用%和/运算符。
 解答：
1. 商：quotient,余数：remainder
 
  q,r=0,a while not (r ]]>https://blog.youkuaiyun.com/thumb3344/article/details/5856844https://blog.youkuaiyun.com/thumb3344/article/details/5856844thumb3344Wed, 01 Sep 2010 23:11:00 +0800https://blog.youkuaiyun.com/thumb3344/article/details/5856793https://blog.youkuaiyun.com/thumb3344/article/details/5856793thumb3344Wed, 01 Sep 2010 22:41:00 +0800 0: b = a*b k = k-1 ]]>https://blog.youkuaiyun.com/thumb3344/article/details/5856750https://blog.youkuaiyun.com/thumb3344/article/details/5856750thumb3344Wed, 01 Sep 2010 22:29:00 +0800https://blog.youkuaiyun.com/thumb3344/article/details/5827801https://blog.youkuaiyun.com/thumb3344/article/details/5827801thumb3344Sat, 21 Aug 2010 00:34:00 +0800******************************
*Diablo 2 Packet Sniffing 101*
******************************
*By: REN3G4DE *
*Written For: Blizz Sector *
*Version: 1.11b *
******************************

First lets start with ]]>https://blog.youkuaiyun.com/thumb3344/article/details/5732472https://blog.youkuaiyun.com/thumb3344/article/details/5732472thumb3344Tue, 13 Jul 2010 18:17:00 +0800https://blog.youkuaiyun.com/thumb3344/article/details/5645124https://blog.youkuaiyun.com/thumb3344/article/details/5645124thumb3344Thu, 03 Jun 2010 16:29:00 +0800由于是从Java转过来的，看见python中有@修饰符时，很迷惑。看了一些网上的资料，感觉叙述的不太容易理解。自己想写一篇易于理解的。先来看一段程序：
def spamrun(fn): def sayspam(*args): a,b =args c,d = a*5, b*5 print c,d return fn(c,d) print 'note!' return sayspam @]]>