经典问题(区间染色和区间查询)
有一面墙,长度为n,每次选择一段儿墙进行染色,m次操作后 ,我们可以看见多少中颜色?m次操作后,我们可以在[i,j]区间内看见多少中颜色?
对此我们可以使用数组和线段树实现:
操作 | 使用数组实现 | 使用线段树实现 |
---|---|---|
更新 | O(n) | O(logn) |
查询 | O(n) | O(logn) |
对于给定区间:
- 更新:更新区间中一个元素或者一个区间的值
- 查询:查询一个区间[i,j]的最大值,最小值,或者区间数字和
线段树不是完全二叉树,但是平衡二叉树。
创建线段树
package 线段树;
/**
* 描述 线段树
*
* @author lixinzhen
* @create 2021/11/2 7:34
*/
public class SegmentTree<E> {
private E[] tree;
private E[] data;
private Merger<E> merger;
public SegmentTree(E[] arr, Merger<E> merger) {
this.merger = merger;
data = (E[]) new Object[data.length];
for (int i = 0; i < arr.length; i++) {
data[i] = arr[i];
}
//对于一个区间内n个元素,只需要开辟4n个静态空间即可
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 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 int getSize() {
return data.length;
}
public E get(int index) {
if (index < 0 || index >= data.length)
throw new IllegalArgumentException("Index is illegal");
return data[index];
}
//返回完全二叉树的数组表示中,一个索引所表示的元素的左孩子节点的索引
private int leftChild(int index) {
return 2 * index + 1;
}
//返回完全二叉树的数组表示中,一个索引所表示的元素的右孩子节点的索引
private 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 || queryL > queryR) {
throw new IllegalArgumentException("Index is illegal.");
}
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, 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 + 1)
return query(rightTreeIndex, mid + 1, r, queryL, queryR);
else if (queryR <= mid)
return query(leftTreeIndex, l, mid, queryL, queryR);
E leftResult = query(leftTreeIndex, l, mid, queryL, mid);
E rightResult = query(rightTreeIndex, mid + 1, r, mid + 1, queryR);
return merger.merge(leftResult, rightResult);
}
线段树中的更新操作
//将Index位置的值,更新为e
public void set(int index, 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);
}
//在以treeIndex为根的线段树中更新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 leftTreeIndex = leftChild(treeIndex);
int rightTreeIndex = rightChild(treeIndex);
if (index >= mid + 1)
set(rightTreeIndex, mid + 1, r, index, e);
else //index<=mid
set(leftTreeIndex, l, mid, index, e);
tree[treeIndex] = merger.merge(tree[leftTreeIndex], tree[rightTreeIndex]);
}