摘要:        
找出一个子树,使之结点的数值之和为最大!View Code 1 class tree_node(object): 2 """docstring for TreeNode""" 3 def __init__(self,val,left = None,right = None): 4 self.val = val 5 self.left = left 6 self.right = right 7 8 9 class attr_of_tree(object):10 """docstring for list_n    阅读全文
        
            posted @ 2012-09-25 14:02
brainworm
阅读(411)
评论(0)
推荐(0)
        
     
                     
                    
                 
                    
                 
         
 浙公网安备 33010602011771号
浙公网安备 33010602011771号