algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 10:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enable ruff RUF100 rule (#11337)

Browse Source
This commit is contained in:
Maxim Smolskiy
2024-04-01 22:36:41 +03:00
committed by GitHub
parent c328b000ec
commit 39daaf8248
14 changed files with 23 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/binary_tree/segment_tree.py
View File

@ -35,7 +35,7 @@ class SegmentTree:
"""
return idx * 2 + 1
def build(self, idx, l, r): # noqa: E741
def build(self, idx, l, r):
if l == r:
self.st[idx] = self.A[l]
else:
@ -56,7 +56,7 @@ class SegmentTree:
"""
return self.update_recursive(1, 0, self.N - 1, a - 1, b - 1, val)
def update_recursive(self, idx, l, r, a, b, val): # noqa: E741
def update_recursive(self, idx, l, r, a, b, val):
"""
update(1, 1, N, a, b, v) for update val v to [a,b]
"""
@ -83,7 +83,7 @@ class SegmentTree:
"""
return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)
def query_recursive(self, idx, l, r, a, b): # noqa: E741
def query_recursive(self, idx, l, r, a, b):
"""
query(1, 1, N, a, b) for query max of [a,b]
"""