2016年4月21日
智取+硬功夫
智取+硬功夫 Read More
posted @ 2016-04-21 19:08 zhaodonglin Views(92) Comments(0) Diggs(0)
Dynamic Programming--shortest path
import unittest# A B1 B2 C1 C2 C3 C4 D1 D2 D3 Egraph=[ [0, 5, 3, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 6, 3, 0, 0, 0, 0, 0], [0, 0, 0, 0, 8, 0, 4, 0, Read More
posted @ 2016-04-21 19:04 zhaodonglin Views(163) Comments(0) Diggs(0)
Greed algorithom-Huffman Tree
import unittest class tree: left_node = None right_node = None value = 0 string = None def __init__(self, left_node, right_node, _val, _str): self.lef Read More
posted @ 2016-04-21 08:05 zhaodonglin Views(156) Comments(0) Diggs(0)