Leet Code'da bulunan 1792 numaralı Maximum Average Pass Ratio sorusunu Python ile çözdük.
00:00 Soruya İlk Bakış
00:50 1. Çözüm Yöntemi O((N+K)LOGN)
--------------------------------------------
Time Complexity
1. Initial Heap Construction:
* The loop iterates over the classes array, which contains n elements (where n is the number of classes).
* For each class:
* The initial possible_inc is calculated in O(1)
* heapq.heappush() is called, which takes O(logn)
* Total time complexity for this phase: O(nlogn)
2. Extra Students Distribution:
* The loop runs k times (where k is the number of extraStudents).
* For each iteration:
* heapq.heappop() takes O(logn)
* Updating the class and calculating po...