algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-07 03:07:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(ci): Update pre-commit hooks and apply new black (#4359)

Browse Source 
* fix(ci): Update pre-commit hooks and apply new black

* remove empty docstring
This commit is contained in:
Dhruv Manilawala
2021-04-26 11:16:50 +05:30
committed by GitHub
parent 69457357e8
commit 6f21f76696
13 changed files with 26 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/heap/heap.py
View File

@ -32,7 +32,7 @@ class Heap:
return str(self.h)
def parent_index(self, child_idx: int) -> Optional[int]:
""" return the parent index of given child """
"""return the parent index of given child"""
if child_idx > 0:
return (child_idx - 1) // 2
return None
@ -78,7 +78,7 @@ class Heap:
self.max_heapify(violation)
def build_max_heap(self, collection: Iterable[float]) -> None:
""" build max heap from an unsorted array"""
"""build max heap from an unsorted array"""
self.h = list(collection)
self.heap_size = len(self.h)
if self.heap_size > 1:
@ -87,14 +87,14 @@ class Heap:
self.max_heapify(i)
def max(self) -> float:
""" return the max in the heap """
"""return the max in the heap"""
if self.heap_size >= 1:
return self.h[0]
else:
raise Exception("Empty heap")
def extract_max(self) -> float:
""" get and remove max from heap """
"""get and remove max from heap"""
if self.heap_size >= 2:
me = self.h[0]
self.h[0] = self.h.pop(-1)
@ -108,7 +108,7 @@ class Heap:
raise Exception("Empty heap")
def insert(self, value: float) -> None:
""" insert a new value into the max heap """
"""insert a new value into the max heap"""
self.h.append(value)
idx = (self.heap_size - 1) // 2
self.heap_size += 1