Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit71ee72e

Browse files
committed
improved some code
1 parent464352f commit71ee72e

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

‎data_structure/heap.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -94,6 +94,7 @@ Heap 可以高效地取出或更新当前池中优先级最高的元素,因此
9494
[See my review here.](https://leetcode.com/problems/maximum-performance-of-a-team/discuss/741822/Met-this-problem-in-my-interview!!!-(Python3-greedy-with-heap))[或者这里(中文)](https://leetcode-cn.com/problems/maximum-performance-of-a-team/solution/greedy-with-min-heap-lai-zi-zhen-shi-mian-shi-de-j/)
9595

9696
```Python
97+
# similar question: LC 857
9798
classSolution:
9899
defmaxPerformance(self,n,speed,efficiency,k):
99100

@@ -105,11 +106,11 @@ class Solution:
105106
for i, (s, e)inenumerate(people):
106107
if i< k:
107108
sum_speed+= s
108-
result=max(result, sum_speed* e)
109109
heapq.heappush(min_heap, s)
110110
elif s> min_heap[0]:
111111
sum_speed+= s- heapq.heappushpop(min_heap, s)
112-
result=max(result, sum_speed* e)
112+
113+
result=max(result, sum_speed* e)
113114

114115
return result#% 1000000007
115116
```

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp