摘要：
1 通过抽象类实现，通过对抽象类中的抽象方法不同的实现，来实现多态。 阅读全文
摘要：
dp[i][j]:从前i种物品中挑选总重量不超过j的总价值的最大值 dp[0][j]=0; dp[i+1][j]={ max(dp[i][j-k*w[i]]+k*v[i],dp[i+1][j]) } 由此，我们可以得到一个递推程序： 其实，dp[i][j]=dp[i-1][j-w[i]]+v[i], 阅读全文
摘要：
Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33719 Accepted Submission(s): 阅读全文
摘要：
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 50442 Accepted Submission(s): 2115 阅读全文
摘要：
<html> <head> <title>canvas绘制图形</title> <style> body{ margin: 0px; padding: 0px; } #mycanvas{ border: 1px solid #9c9898; } </style> <script type=text/ 阅读全文
摘要：
Dertouzos Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1415 Accepted Submission(s): 443 Prob 阅读全文
摘要：
def square_of_sum(L): sum=0; for i in L: sum+=i*i return sum print square_of_sum([1, 2, 3, 4, 5])print square_of_sum([-5, 0, 5, 15, 25]) import math d 阅读全文