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

[mypy] Add/fix type annotations for binary trees in data structures (#4085)

Browse Source 
* fix mypy: data_structures:binary_tree

* mypy --strict for binary_trees in data_structures

* fix pre-commit

Co-authored-by: LiHao <leo_how@163.com>
This commit is contained in:
Hao LI
2021-02-05 00:59:38 +08:00
committed by GitHub
parent 97b6ca2b19
commit 2595cf059d
3 changed files with 84 additions and 57 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
data_structures/binary_tree/lazy_segment_tree.py
View File

@ -1,6 +1,7 @@
from __future__ import annotations
import math
from typing import List, Union
class SegmentTree:
@ -37,7 +38,7 @@ class SegmentTree:
return idx * 2 + 1
def build(
self, idx: int, left_element: int, right_element: int, A: list[int]
self, idx: int, left_element: int, right_element: int, A: List[int]
) -> None:
if left_element == right_element:
self.segment_tree[idx] = A[left_element - 1]
@ -88,7 +89,7 @@ class SegmentTree:
# query with O(lg n)
def query(
self, idx: int, left_element: int, right_element: int, a: int, b: int
) -> int:
) -> Union[int, float]:
"""
query(1, 1, size, a, b) for query max of [a,b]
>>> A = [1, 2, -4, 7, 3, -5, 6, 11, -20, 9, 14, 15, 5, 2, -8]
@ -118,8 +119,8 @@ class SegmentTree:
q2 = self.query(self.right(idx), mid + 1, right_element, a, b)
return max(q1, q2)
def __str__(self) -> None:
return [self.query(1, 1, self.size, i, i) for i in range(1, self.size + 1)]
def __str__(self) -> str:
return str([self.query(1, 1, self.size, i, i) for i in range(1, self.size + 1)])
if __name__ == "__main__":