java segment_java——线段树 SegmentTree

public class SegmentTree{privateE[] tree;privateE[] data;private Mergermerger;public SegmentTree(E[] arr, Mergermerger) {this.merger =merger;

data= (E[]) newObject[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);

}//在tree Index的位置创建表示区间[l ... r]的线段树

private void buildSegmentTree(int treeIndex, int l, intr) {if(l ==r) {

tree[treeIndex]=data[l];return;

}int leftTreeIndex =leftChild(treeIndex);int rightTreeIndex =rightChild(treeIndex);int mid = l + (r - l) / 2;

buildSegmentTree(leftTreeIndex, l, mid);

buildSegmentTree(rightTreeIndex, mid+ 1, r);//根据业务组合线段树

tree[treeIndex] =merger.merge(tree[leftTreeIndex], tree[rightTreeIndex]);

}public E get(intindex) {if(index < 0 || index >=data.length) {throw new IllegalArgumentException("Index is illegal.");

}returndata[index];

}public intgetSize() {returndata.length;

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

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

}public E query(int queryL, intqueryR) {if(queryL < 0 || queryL >= data.length || queryR

}return query(0, 0, data.length -1, queryL, queryR);

}//查询线段树//在以treeID为根的线段树中[l...r]的范围里，搜索区间[queryL...queryR]的值

private E query(int treeIndex, int l, int r, int queryL, intqueryR) {if(l == queryL && r ==queryR) {returntree[treeIndex];

}int mid = l + (r-l)/2;int leftTreeIndex =leftChild(treeIndex);int rightTreeIndex =rightChild(treeIndex);if(queryL >= mid +1) {return query(rightTreeIndex, mid + 1, r, queryL, queryR);

}else if(queryR <=mid) {returnquery(leftTreeIndex, l, mid, queryL, queryR);

}else{//这种情况下产生了两段线段树，需要进行融合

E leftResult =query(leftTreeIndex, l, mid, queryL, mid);

E rightResult= query(rightTreeIndex, mid + 1, r, mid + 1, queryR);returnmerger.merge(leftResult, rightResult);

}

}//将index位置的值更新为e

public void set(intindex, E e) {if(index < 0 || index >=data.length) {throw new IllegalArgumentException("Index is illegal");

}

data[index]=e;

set(0,0, data.length - 1, index, e);

}private void set(int treeIndex, int l, int r, intindex, 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 + 1) {

set(rightTreeIndex, mid+ 1, r, index, e);

}else{

set(leftTreeIndex, l, mid, index, e);

}

tree[treeIndex]=merger.merge(tree[leftTreeIndex], tree[rightTreeIndex]);

}

@OverridepublicString toString() {

StringBuilder res= newStringBuilder();

res.append('[');for(int i = 0 ; i < tree.length ; i ++) {if(tree[i] != null) {

res.append(tree[i]);

}else{

res.append("null");

}if(i != tree.length - 1) {

res.append(", ");

}

}

res.append("]");returnres.toString();

}

}