线段树

数组转成线段树，递归实现

线段树这种数据结构可以让统计更快，比如任何多数据求和操作可以在LOG（N）的复杂度完成。

public class SegmentTree<E> {

    private E[] data;
    private E[] tree;
    private Marger<E> marger;
    public SegmentTree(E[] arr, Marger<E> marger) {
        data=(E[]) new Object[arr.length];
        this.marger = marger;
        for (int i = 0; i < arr.length; i++) {
            E e=arr[i];
            data[i]=e;
        }

        tree= (E[]) new Object[4*arr.length];
        buildSegmentTree(0,0,data.length-1);

    }

    //zai treeindex位置，创建表示区间【l,r】的线段树
    private void buildSegmentTree(int treeIndex, int l, int r) {
        if (l==r){
            tree[treeIndex]=data[l];
            return;
        }

        int leftindex=leftChild(treeIndex);
        int rightindex=rightChild(treeIndex);
        int mid=l+(r-l)/2;
        buildSegmentTree(leftindex,l,mid);
        buildSegmentTree(rightindex,mid+1,r);
        tree[treeIndex]= marger.marger(tree[leftindex],tree[rightindex]);


    }

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

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

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

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

        }

    public static void main(String[] args) {

        Integer[] nums={-2,0,3,-5,2,-1};
        SegmentTree<Integer> segmentTree=new SegmentTree<Integer>(nums, (a,b)->a+b);
        System.out.println(segmentTree.toString());
    }
    
    
}复制代码

转载于:https://juejin.im/post/5d020087e51d45776147612e