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/max_heap.py
View File

@ -21,7 +21,7 @@ class BinaryHeap:
self.__size = 0
def __swap_up(self, i: int) -> None:
""" Swap the element up """
"""Swap the element up"""
temporary = self.__heap[i]
while i // 2 > 0:
if self.__heap[i] > self.__heap[i // 2]:
@ -30,13 +30,13 @@ class BinaryHeap:
i //= 2
def insert(self, value: int) -> None:
""" Insert new element """
"""Insert new element"""
self.__heap.append(value)
self.__size += 1
self.__swap_up(self.__size)
def __swap_down(self, i: int) -> None:
""" Swap the element down """
"""Swap the element down"""
while self.__size >= 2 * i:
if 2 * i + 1 > self.__size:
bigger_child = 2 * i
@ -52,7 +52,7 @@ class BinaryHeap:
i = bigger_child
def pop(self) -> int:
""" Pop the root element """
"""Pop the root element"""
max_value = self.__heap[1]
self.__heap[1] = self.__heap[self.__size]
self.__size -= 1
@ -65,7 +65,7 @@ class BinaryHeap:
return self.__heap[1:]
def __len__(self):
""" Length of the array """
"""Length of the array"""
return self.__size