算法学习
文章平均质量分 57
u010565244
这个作者很懒,什么都没留下…
展开
-
算法 活动选择问题
参考博客:http://www.cnblogs.com/Anker/archive/2013/03/16/2963625.html原创 2014-04-15 00:46:30 · 537 阅读 · 0 评论 -
参考别人代码实现二叉树
#encoding=utf-8class TreeNode: """ 树节点类 """ left,right,data=None,None,0 def __init__(self,data): #self.parent=None self.left=None self.right=None转载 2014-03-20 17:34:27 · 455 阅读 · 0 评论 -
算法0-1背包问题:
参考博客:http://blog.csdn.net/livelylittlefish/article/details/2186206http://www.cnblogs.com/Anker/archive/2013/05/04/3059070.html原创 2014-04-17 17:50:16 · 613 阅读 · 0 评论 -
二叉树一点实现python版
class TreeNode: parent,leftChild,rightChild,data=None,None,None,0 def __init__(self,data): self.parent,self.leftChild,self.rightChild,self.data=None,None,None,dataclass BinaryTree:原创 2014-03-23 18:19:24 · 516 阅读 · 0 评论 -
哈夫曼树实现 python
参考博客:http://linux.xidian.edu.cn/bbs/thread-70-1-1.html转载 2014-04-21 01:18:33 · 2352 阅读 · 0 评论 -
动态规则装配线调度
参照:http://blog.csdn.net/tanyujing/article/details/8555618__author__ = 'Administrator'#encoding=utf-8def fastest_way(pointCost,leaveCost,firstEntryCost,finalLeaveCost,Cost,lineNo,lineSize):原创 2014-04-07 15:32:30 · 513 阅读 · 0 评论 -
LCSpython
def LCS_Length(seq1,seq2): len1,len2=len(seq1),len(seq2) countLength=[ [ 0 for col in xrange(len2)] for row in xrange(len1) ] backmark=[ [ (0,0) for col in xrange(len2)] for row in xran原创 2014-04-09 00:20:43 · 939 阅读 · 0 评论 -
No_37
参考博客:http://www.mathblog.dk/project-euler-37-truncatable-primes/题目:The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from原创 2014-05-09 22:37:45 · 429 阅读 · 0 评论 -
No_38Pandigital multiples
题目:Take the number 192 and multiply it by each of 1, 2, and 3:192 1 = 192192 2 = 384192 3 = 576By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 19238457原创 2014-05-09 22:40:44 · 528 阅读 · 0 评论