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

Flake8: Drop ignore of issue A003 (#7949)

Browse Source 
* Flake8: Drop ignore of issue A003

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2022-11-02 19:20:45 +01:00
committed by GitHub
parent 598f6a26a1
commit 45b3383c39
9 changed files with 42 additions and 62 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/binary_tree/fenwick_tree.py
View File

@ -46,7 +46,7 @@ class FenwickTree:
self.size = len(arr)
self.tree = deepcopy(arr)
for i in range(1, self.size):
j = self.next(i)
j = self.next_(i)
if j < self.size:
self.tree[j] += self.tree[i]
@ -64,13 +64,13 @@ class FenwickTree:
"""
arr = self.tree[:]
for i in range(self.size - 1, 0, -1):
j = self.next(i)
j = self.next_(i)
if j < self.size:
arr[j] -= arr[i]
return arr
@staticmethod
def next(index: int) -> int:
def next_(index: int) -> int:
return index + (index & (-index))
@staticmethod
@ -102,7 +102,7 @@ class FenwickTree:
return
while index < self.size:
self.tree[index] += value
index = self.next(index)
index = self.next_(index)
def update(self, index: int, value: int) -> None:
"""