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

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062)

Browse Source 
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038)

* refactor: Fix naming conventions (#7038)

* Update arithmetic_analysis/lu_decomposition.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038)

* chore: Fix naming conventions in doctests (#7038)

* fix: Temporarily disable project euler problem 104 (#7069)

* chore: Fix naming conventions in doctests (#7038)

Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Caeden
2022-10-12 23:54:20 +01:00
committed by GitHub
parent e2cd982b11
commit 07e991d553
140 changed files with 1552 additions and 1536 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
data_structures/binary_tree/avl_tree.py
View File

@ -12,7 +12,7 @@ import random
from typing import Any
class my_queue:
class MyQueue:
def __init__(self) -> None:
self.data: list[Any] = []
self.head: int = 0
@ -39,20 +39,20 @@ class my_queue:
print(self.data[self.head : self.tail])
class my_node:
class MyNode:
def __init__(self, data: Any) -> None:
self.data = data
self.left: my_node | None = None
self.right: my_node | None = None
self.left: MyNode | None = None
self.right: MyNode | None = None
self.height: int = 1
def get_data(self) -> Any:
return self.data
def get_left(self) -> my_node | None:
def get_left(self) -> MyNode | None:
return self.left
def get_right(self) -> my_node | None:
def get_right(self) -> MyNode | None:
return self.right
def get_height(self) -> int:
@ -62,11 +62,11 @@ class my_node:
self.data = data
return
def set_left(self, node: my_node | None) -> None:
def set_left(self, node: MyNode | None) -> None:
self.left = node
return
def set_right(self, node: my_node | None) -> None:
def set_right(self, node: MyNode | None) -> None:
self.right = node
return
@ -75,7 +75,7 @@ class my_node:
return
def get_height(node: my_node | None) -> int:
def get_height(node: MyNode | None) -> int:
if node is None:
return 0
return node.get_height()
@ -87,7 +87,7 @@ def my_max(a: int, b: int) -> int:
return b
def right_rotation(node: my_node) -> my_node:
def right_rotation(node: MyNode) -> MyNode:
r"""
A B
/ \ / \
@ -110,7 +110,7 @@ def right_rotation(node: my_node) -> my_node:
return ret
def left_rotation(node: my_node) -> my_node:
def left_rotation(node: MyNode) -> MyNode:
"""
a mirror symmetry rotation of the left_rotation
"""
@ -126,7 +126,7 @@ def left_rotation(node: my_node) -> my_node:
return ret
def lr_rotation(node: my_node) -> my_node:
def lr_rotation(node: MyNode) -> MyNode:
r"""
A A Br
/ \ / \ / \
@ -143,16 +143,16 @@ def lr_rotation(node: my_node) -> my_node:
return right_rotation(node)
def rl_rotation(node: my_node) -> my_node:
def rl_rotation(node: MyNode) -> MyNode:
right_child = node.get_right()
assert right_child is not None
node.set_right(right_rotation(right_child))
return left_rotation(node)
def insert_node(node: my_node | None, data: Any) -> my_node | None:
def insert_node(node: MyNode | None, data: Any) -> MyNode | None:
if node is None:
return my_node(data)
return MyNode(data)
if data < node.get_data():
node.set_left(insert_node(node.get_left(), data))
if (
@ -180,7 +180,7 @@ def insert_node(node: my_node | None, data: Any) -> my_node | None:
return node
def get_rightMost(root: my_node) -> Any:
def get_right_most(root: MyNode) -> Any:
while True:
right_child = root.get_right()
if right_child is None:
@ -189,7 +189,7 @@ def get_rightMost(root: my_node) -> Any:
return root.get_data()
def get_leftMost(root: my_node) -> Any:
def get_left_most(root: MyNode) -> Any:
while True:
left_child = root.get_left()
if left_child is None:
@ -198,12 +198,12 @@ def get_leftMost(root: my_node) -> Any:
return root.get_data()
def del_node(root: my_node, data: Any) -> my_node | None:
def del_node(root: MyNode, data: Any) -> MyNode | None:
left_child = root.get_left()
right_child = root.get_right()
if root.get_data() == data:
if left_child is not None and right_child is not None:
temp_data = get_leftMost(right_child)
temp_data = get_left_most(right_child)
root.set_data(temp_data)
root.set_right(del_node(right_child, temp_data))
elif left_child is not None:
@ -276,7 +276,7 @@ class AVLtree:
"""
def __init__(self) -> None:
self.root: my_node | None = None
self.root: MyNode | None = None
def get_height(self) -> int:
return get_height(self.root)
@ -296,7 +296,7 @@ class AVLtree:
self,
) -> str: # a level traversale, gives a more intuitive look on the tree
output = ""
q = my_queue()
q = MyQueue()
q.push(self.root)
layer = self.get_height()
if layer == 0: