Java 实现线段树

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

线段树代码

/**
 * @since 2022/4/2
 *  线段树
 */
public class SegmentTree<E> {
    //线段树
    private E[] tree;
    //数据
    private E[] data;
    //融合器
    private Merger<E> merger;

    /**
     * 构造函数
     * @param arr
     */
    public SegmentTree(E[] arr)
    {
        data = (E[])new Object [arr.length];
        tree = (E[])new Object [arr.length * 4];
        // 最好情况 2*n-1 最坏情况 4*n-5
        for(int i = 0; i < arr.length; i++){
            data[i] = arr[i];
        }
        // 也可用System.arraycopy(arr, 0, data, 0, arr.length)，但需考虑深浅克隆;
    }
    public SegmentTree(E[] arr,Merger<E> merger)
    {
        this.merger = merger;
        data = (E[])new Object [arr.length];
        tree = (E[])new Object [arr.length * 4];
        // 最好情况 2*n-1 最坏情况 4*n-5
        for(int i = 0; i < arr.length; i++){
            data[i] = arr[i];
        }
        buildSegmentTree(0,0, data.length-1);
    }

    /**
     * 返回数组元素个数
     */
    public int getSize(){
        return data.length;
    }

    /**
     * @param index 索引
     * @return 直接索引获取数据
     */
    public E get(int index){
        if(index < 0 || index > data.length){
            throw new IllegalArgumentException("error index");
        }
        return data[index];
    }

    /**
     * 左孩子查询
     * @return 通过索引查询左孩子的索引
     */
    private int leftChild(int index){
        return 2 * index + 1;
    }

    /**
     * 右孩子查询
     * @return 通过索引查询右孩子的索引
     */
    private int rightChild(int index){
        return 2 * index + 2;
    }

    /**
     * 创建线段树
     * @param treeIndex 构建线段树的位置区间
     * @param l 线段树区间左边界
     * @param r 线段树区间右边界
     */
    private void buildSegmentTree(int treeIndex, int l , int r){
        if(l == r){
            // l == r 递归到叶子节点
            tree[treeIndex] = data[l];
            return;
        }
        int leftTreeIndex = leftChild(treeIndex);
        int rightTreeIndex = rightChild(treeIndex);
        int mid = l + (r - l) / 2;
        System.out.println(leftTreeIndex+"|"+rightTreeIndex+"|"+mid);
        buildSegmentTree(leftTreeIndex,l,mid);
        buildSegmentTree(rightTreeIndex,mid+1,r);
        tree[treeIndex] = merger.merge(tree[leftTreeIndex],tree[rightTreeIndex]);
    }

    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);
    }

    /**
     * 线段树查询
     * @param treeIndex 构建线段树的位置区间
     * @param l 线段树区间左边界
     * @param r 线段树区间右边界
     * @param queryL 搜索左区间
     * @param queryR 搜索右区间
     *
     */
    public 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 leftTreeIndex = leftChild(treeIndex);
        int rightTreeIndex = rightChild(treeIndex);
        if(queryL > mid){
            return query(rightTreeIndex,mid+1,r,queryL,queryR);
        }
        if(queryR <= mid){
            return query(leftTreeIndex,1,mid,queryL,queryR);
        }
        E rightResult = query(rightTreeIndex,mid+1,r,queryL,queryR);
        E leftResult = query(leftTreeIndex,1,mid,queryL,queryR);
        return merger.merge(leftResult,rightResult);
    }

    /**
     * 线段树更新
     * @param index 更新位置
     * @param e 更新数据
     */
    private void update(int index , E e ){
        if(index < 0 || index >= data.length){
            throw new IllegalArgumentException("error data");
        }
        data[index] = e;
        updateTree(0,0,data.length-1,index,e);
    }

    private void updateTree(int treeIndex, int l, int r, int index, E e) {
        if (l == r) {
            tree[treeIndex] = e;
            return;
        }
        int mid = l + (r - l) / 2;
        int leftTreeIndex = leftChild(treeIndex);
        int rightTreeIndex = rightChild(treeIndex);
        if (index > mid) {
            updateTree(rightTreeIndex, mid + 1, r, index, e);
        } else //index <= mid
        {
            updateTree(leftTreeIndex, l, mid, index, e);
        }
        tree[treeIndex] = merger.merge(tree[leftTreeIndex], tree[rightTreeIndex]);
    }

}

/**
 * 区间合并
 * @param <E>
 */
interface Merger<E> {
    E merge(E a,E b);
}

测试类

public class Test1 {
    public static void main(String[] args) {
        testSegmentTree();
    }
    public static void testSegmentTree(){
        Integer[] nums = new Integer[]{34, 65, 8, 10, 21, 86, 79, 30};
        SegmentTree<Integer> segTree = new SegmentTree<>(nums, new Merger<Integer>() {
            @Override
            public Integer merge(Integer a, Integer b) {
                //返回 a 和 b 的最大值
                return Math.max(a, b);
            }
        });
        // 查询区间 [2,5] 的最大值
        System.out.println(segTree.query(4, 7));
    }
}