KY188 哈夫曼树

最新推荐文章于 2024-07-25 11:27:31 发布

敲代码的小风

最新推荐文章于 2024-07-25 11:27:31 发布

阅读量119

点赞数

分类专栏：牛客网-计算机考研上机复试文章标签：算法 python

本文链接：https://blog.csdn.net/m0_46653437/article/details/128167102

版权

牛客网-计算机考研上机复试专栏收录该内容

155 篇文章 2 订阅

订阅专栏

KY188 哈夫曼树

import heapq

class TreeNode():
    def __init__(self, weight=0, weightedLength=0):
        self.weight = weight
        self.weightedLength = weightedLength
        self.leftChild, self.rightChild = None, None
    def addChildren(self, leftChild, rightChild):
        self.leftChild, self.rightChild = leftChild, rightChild
        self.weight = leftChild.weight + rightChild.weight
        self.weightedLength = leftChild.weightedLength + \
            rightChild.weightedLength + self.weight
    def __lt__(self, obj):
        return self.weight < obj.weight

def main():
    n = int(input().strip())
    weights = list(map(eval,input().strip().split()))
    treesList = list()
    for w in weights:
        heapq.heappush(treesList,TreeNode(weight=w))
    while len(treesList)>1:
        left = heapq.heappop(treesList)
        right = heapq.heappop(treesList)
        tree = TreeNode()
        tree.addChildren(left,right)
        heapq.heappush(treesList, tree)
    print(tree.weightedLength)

if __name__=='__main__':
    try:
        main()
    except:
        pass