题目:原题链接(困难)
标签:数学、堆、动态规划
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( N l o g N ) O(NlogN) O(NlogN) | O ( N ) O(N) O(N) | 60ms (50.00%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def minBuildTime(self, blocks: List[int], split: int) -> int:
heapq.heapify(blocks)
while len(blocks) > 1:
new = split + max(heapq.heappop(blocks), heapq.heappop(blocks))
heapq.heappush(blocks, new)
return blocks.pop()