Lintcode 791. Merge Number (Medium) (Python) (未完成)

最新推荐文章于 2024-08-01 21:07:10 发布

2Young2Simple

最新推荐文章于 2024-08-01 21:07:10 发布

阅读量148

点赞数

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/82017543

版权

Lintcode刷题专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Merge Number

Description:

Given n numbers, now we need to merge n numbers into one number. And each time we can only select and merge two numbers a,b. Each merger needs to consume a+b energy. Output the minimum energy consumed by merging n numbers.

Example
Given [1,2,3,4], return 19

Explanation:
Merge 1,2, which consumes 3 energy, and the rest is [3,4,3]. Merge 3,3, which consumes 6 energy, and the rest is [6,4]. Merge the last two numbers, which consumes 10 energy, and a total of 19 energy was consumed.
Given [2,8,4,1], return 25

explanation:
Merge 1,2, which consumes 3 energy, and the rest is [8,4,3]. Merge 3,4, which consumes 7 energy, and the rest is [7,8]. Merge the last two numbers, which consumes 15 energy, and a total of 25 energy was consumed.
Notice
2 <= n <= 50000, the combined number will not exceed the int range

Code:

超时

class Solution:
    """
    @param numbers: the numbers
    @return: the minimum cost
    """
    def mergeNumber(self, numbers):
        # Write your code here
        numbers.sort()
        sum = 0
        print numbers
        while len(numbers)>1:
            cnt, numbers = self.helper(numbers)
            sum += cnt
        return sum

    def helper(self, numbers):
        cnt = numbers[0] + numbers[1]
        numbers = numbers[2:]
        numbers.append(cnt)
        numbers.sort()
        return cnt, numbers