线段树

性质：

是平衡二叉树

 

public class SegmentTree<E> {
    private E[] tree;
    private E[] data;
    private Merge<E> merge;

    public SegmentTree(E[]arr, Merge<E> merge){
        this.merge = merge;

       data = (E[]) new Object[arr.length];
        for (int i = 0; i < arr.length; i++) {
            data[i] = arr[i];
        }
        tree =(E[]) new Object[4 * arr.length];
        buildSegmentTree(0,0,data.length - 1);
    }

    //在treeIndex的位置创建表示区间[l,r]的线段树
    private void buildSegmentTree(int treeIndex,int l, int r){
        if(l == r){
            tree[treeIndex] = data[l];
            return;
        }
        int leftChildIndex = leftChild(treeIndex);
        int rightChildIndex = rightChild(treeIndex);

        int mid = l + (r - l) / 2;
        buildSegmentTree(leftChildIndex, l, mid);
        buildSegmentTree(rightChildIndex, mid+1, r);

        tree[treeIndex] = merge.merge(tree[leftChildIndex], tree[rightChildIndex]);

    }

    public int getSize(){
        return data.length;
    }

    public E get(int index){
        if (index < 0 || index >= data.length) {
            throw new IllegalArgumentException("index is failed");
        }
        return data[index];
    }

    public int leftChild(int index){
        return 2 * index + 1;
    }

    public int rightChild(int index){
        return 2 * index + 2;
    }

    //返回区间[queryL , queryR]的值
    public E query(int queryL, int queryR){
        if(queryL < 0 || queryL > data.length || queryR < 0 || queryR > data.length){
            throw new IllegalArgumentException("index is failed");
        }
        return query(0, 0, data.length -1, queryL, queryR);
    }
    private E query(int treeIndex, int l, int r, int queryL, int queryR){
        if(l == queryL && r == queryR){
            return tree[treeIndex];
        }
        int mid = l + (r - l) / 2;
        int leftChildIndex = leftChild(treeIndex);
        int rightChildIndex = rightChild(treeIndex);

        if(queryL >= mid + 1){
            return query(rightChildIndex, mid + 1, r, queryL, queryR);
        }
        else if (queryR <= mid){
            return query(leftChildIndex, l, mid, queryL, queryR);
        }
        E leftResult = query(leftChildIndex, l, mid, queryL, mid);
        E rightResult = query(rightChildIndex, mid, r, mid, queryR);
        return merge.merge(leftResult, rightResult);
    }

    //将index位置的值，更新为e
    public void set(int index, E e){
        if(index < 0 || index >= data.length){
            throw new IllegalArgumentException("index is failed");
        }
        data[index] = e;
        set(0, 0, data.length-1, index, e);
    }
    private void set(int treeIndex, int l, int r, int index, E e){
        if(l == r){
            tree[treeIndex] = e;
            return;
        }
        int mid = l + (r - l) / 2;
        int leftChildIndex = leftChild(treeIndex);
        int rightChildIndex = rightChild(treeIndex);
        if(index >= mid + 1){
            set(rightChildIndex, mid + 1, r, index, e);
        }
        else if(index <= mid){
            set(leftChildIndex, l, mid, index, e);
        }
        tree[treeIndex] = merge.merge(tree[leftChildIndex], tree[rightChildIndex]);
    }

    @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        res.append('[');
        for (int i = 0; i < tree.length; i++) {
            if(null != tree[i]){
                res.append(tree[i]);
            }else {
                res.append("null");
            }
            if (i != tree.length - 1) {
                res.append(",");
            }
        }
        res.append(']');
        return res.toString();
    }
}