线段树 实现 查询和更新

public class SegmentTree<E>{

    private E[] data;
    private E[] tree;
    private Merger<E> merge;

    public SegmentTree(E[] arr, Merger<E> merge) {

        // 融合器
        this.merge = merge;
        data = (E[]) new Object[arr.length];
        // 线段树长度最大为4n
        tree = (E[]) new Object[4 * arr.length];

        for (int i = 0; i < arr.length; i++) {
            data[i] = arr[i];
        }
        buildSegmentTree(0, 0, arr.length-1);
    }

    // 建立维护区间为[l, r] 引索为index的节点
    private void buildSegmentTree(int index, int l, int r) {
        // 如果l==r说明到了叶子节点
        if (l == r) {
            tree[index] = data[l];
            return;
        }
        int mid = l + (r - l) / 2;
        // 建立左右孩子节点
        buildSegmentTree(leftChild(index), l, mid);
        buildSegmentTree(rightChild(index), mid + 1, r);
        // 此节点维护的值为左右孩子节点的值的和
        tree[index] = merge.merge(tree[leftChild(index)], tree[rightChild(index)]);
    }

    public E query(int queryL, int queryR) {
        if(queryL < 0 || queryL >= data.length ||
                queryR < 0 || queryR >= data.length || queryL > queryR)
            throw new IllegalArgumentException("Index is illegal.");
        return query(0, 0, data.length-1, queryL, queryR);
    }
    // 在维护区间[l,r]引索为index的节点中 查询区间queryL 到 queryR的和
    private E query(int index, int l, int r, int queryL, int queryR) {

        // 如果区间正好相符 则直接返回节点值
        if (l == queryL && r == queryR) {
            return tree[index];
        }

        int mid = l + (r-l)/2;

        // 查询区间全部在一侧子树 则直接return
        if (queryL > mid) {
            return query(rightChild(index), mid + 1, r, queryL, queryR);
        } else if (queryR <= mid) {
            return query(leftChild(index), l, mid, queryL, queryR);
        }

        // 如果一段在左边 一段在右边 则需要把两段相加之后return
        E leftResult = query(leftChild(index), l, mid, queryL, mid);
        E rightResult = query(rightChild(index), mid+1, r, mid+1, queryR);

        return merge.merge(leftResult, rightResult);
    }

    public void set(int index, E e) {
        data[index] = e;
        set(0, 0, data.length-1, index, e);
    }

    // 去找data[index]在tree中对应的叶子节点 更新他 然后连着他爸他爷爷一起更新
    private void set(int treeIndex, int l, int r, int index, E e) {

        // 找到了
        if (l == r)
            tree[treeIndex] = e;

        int mid = l + (r-l)/2;
        // 往左找
        if (index <= mid) {
            set(leftChild(treeIndex), l , mid, index, e);
        } else {
            // 往右找
            set(rightChild(treeIndex), mid+1, r, index, e);
        }

        // 更新此节点的值
        tree[treeIndex] = merge.merge(tree[leftChild(treeIndex)], tree[rightChild(treeIndex)]);

    }
    
    // 左孩子的索引值
    private int leftChild(int index) {
        return 2 * index + 1;
    }

    // 右孩子的索引值
    private int rightChild(int index) {
        return  2 * index + 2;
    }
}

Merger

public interface Merger<E> {

    E merge(E a, E b);

}