OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

update docstrings

Browse Source
This commit is contained in:
Aryan Gandhi 2023-10-07 00:47:51 -05:00
parent feaca465cb
commit a725bedead
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
data_structures/binary_tree/segment_tree.py
View File

@ -3,7 +3,8 @@ import math
class SegmentTree:
def __init__(self, a):
self.N = len(a)
self.A = a
self.N = len(self.A)
self.st = [0] * (
4 * self.N
) # approximate the overall size of segment tree with array N
@ -36,7 +37,7 @@ class SegmentTree:
def build(self, idx, l, r): # noqa: E741
if l == r:
self.st[idx] = A[l]
self.st[idx] = self.A[l]
else:
mid = (l + r) // 2
self.build(self.left(idx), l, mid)
@ -76,9 +77,9 @@ class SegmentTree:
>>> s = SegmentTree([1, 2, 3, 4, 5])
>>> s.query(1, 3)
2
3
>>> s.query(1, 5)
7
5
"""
return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)