mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Delete median_from_stream.py
This commit is contained in:
parent
bf35809bb2
commit
f75b102b78
@ -1,37 +0,0 @@
|
|||||||
#!/usr/bin/env python3
|
|
||||||
# -*- coding: utf-8 -*-
|
|
||||||
# author: bt3gl
|
|
||||||
|
|
||||||
|
|
||||||
class MedianFinder:
|
|
||||||
|
|
||||||
def __init__(self):
|
|
||||||
|
|
||||||
self.min_heap = []
|
|
||||||
self.max_heap = []
|
|
||||||
|
|
||||||
|
|
||||||
def addNum(self, num: int) -> None:
|
|
||||||
|
|
||||||
min_heap, max_heap = self.min_heap, self.max_heap
|
|
||||||
|
|
||||||
if len(min_heap) < len(max_heap):
|
|
||||||
heappush(min_heap, num)
|
|
||||||
|
|
||||||
else:
|
|
||||||
heappush(max_heap, -num)
|
|
||||||
|
|
||||||
if max_heap and min_heap and -max_heap[0] > min_heap[0]:
|
|
||||||
|
|
||||||
heappush(max_heap, -heappop(min_heap))
|
|
||||||
heappush(min_heap, -heappop(max_heap))
|
|
||||||
|
|
||||||
|
|
||||||
def findMedian(self):
|
|
||||||
|
|
||||||
min_heap, max_heap = self.min_heap, self.max_heap
|
|
||||||
|
|
||||||
if len(min_heap) < len(max_heap):
|
|
||||||
return -max_heap[0]
|
|
||||||
|
|
||||||
return (min_heap[0] - max_heap[0]) / 2
|
|
Loading…
x
Reference in New Issue
Block a user