mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-05 13:26:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] Fix type annotations in data_structures/binary_tree/lowest_common_ancestor.py (#5757)

Browse Source 
* Fix type annotations in lowest_common_ancestor.py

* Refactor line 53 in lowest_common_ancestor.py
This commit is contained in:
Dylan Buchi 2021-11-03 17:34:08 -03:00 committed by GitHub
parent 7954a3ae16
commit 331fe6d3bc
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
data_structures/binary_tree/lowest_common_ancestor.py
View File

@ -3,7 +3,7 @@
from __future__ import annotations from __future__ import annotations
import queue from queue import Queue
def swap(a: int, b: int) -> tuple[int, int]: def swap(a: int, b: int) -> tuple[int, int]:
@ -37,7 +37,7 @@ def create_sparse(max_node: int, parent: list[list[int]]) -> list[list[int]]:
# returns lca of node u,v # returns lca of node u,v
def lowest_common_ancestor( def lowest_common_ancestor(
u: int, v: int, level: list[int], parent: list[list[int]] u: int, v: int, level: list[int], parent: list[list[int]]
) -> list[list[int]]: ) -> int:
# u must be deeper in the tree than v # u must be deeper in the tree than v
if level[u] < level[v]: if level[u] < level[v]:
u, v = swap(u, v) u, v = swap(u, v)
@ -50,7 +50,7 @@ def lowest_common_ancestor(
return u return u
# moving both nodes upwards till lca in found # moving both nodes upwards till lca in found
for i in range(18, -1, -1): for i in range(18, -1, -1):
if parent[i][u] != 0 and parent[i][u] != parent[i][v]: if parent[i][u] not in [0, parent[i][v]]:
u, v = parent[i][u], parent[i][v] u, v = parent[i][u], parent[i][v]
# returning longest common ancestor of u,v # returning longest common ancestor of u,v
return parent[0][u] return parent[0][u]
@ -61,8 +61,8 @@ def breadth_first_search(
level: list[int], level: list[int],
parent: list[list[int]], parent: list[list[int]],
max_node: int, max_node: int,
graph: dict[int, int], graph: dict[int, list[int]],
root=1, root: int = 1,
) -> tuple[list[int], list[list[int]]]: ) -> tuple[list[int], list[list[int]]]:
""" """
sets every nodes direct parent sets every nodes direct parent
@ -70,7 +70,7 @@ def breadth_first_search(
calculates depth of each node from root node calculates depth of each node from root node
""" """
level[root] = 0 level[root] = 0
q = queue.Queue(maxsize=max_node) q: Queue[int] = Queue(maxsize=max_node)
q.put(root) q.put(root)
while q.qsize() != 0: while q.qsize() != 0:
u = q.get() u = q.get()
@ -88,7 +88,7 @@ def main() -> None:
parent = [[0 for _ in range(max_node + 10)] for _ in range(20)] parent = [[0 for _ in range(max_node + 10)] for _ in range(20)]
# initializing with -1 which means every node is unvisited # initializing with -1 which means every node is unvisited
level = [-1 for _ in range(max_node + 10)] level = [-1 for _ in range(max_node + 10)]
graph = { graph: dict[int, list[int]] = {
1: [2, 3, 4], 1: [2, 3, 4],
2: [5], 2: [5],
3: [6, 7], 3: [6, 7],