使用python实现fenwick树

class fenwicktree():
    def __init__(self, size):
        #size为所创建的树的大小
        self.size = size
        self.tree = [0] * (size + 1)

    def add(self, idx, delta):
        #将索引idx更新为delta，索引从0开始
        idx += 1
        while idx <= self.size:
            self.tree[idx] += delta
            idx += idx & -idx

    def sum(self, i, j):
        #返回索引i到索引j的和，包括i但是不包括j
        return self.prefix_sum(j) - self.prefix_sum(i)

    def prefix_sum(self, idx):
        #返回前idx个数的和
        res = 0
        while idx > 0:
            res += self.tree[idx]
            idx -= idx & -idx
        return res

#测试
tree = fenwicktree(5)
tree.add(0, 1)
tree.add(1, 2)
tree.add(2, 3)
tree.add(3, 4)
tree.add(4, 5)

print(tree.sum(1, 3))
#输出5
print(tree.prefix_sum(5)) 
#输出15