题目地址:
https://www.lintcode.com/problem/segment-tree-build-ii/description
给定一个数组,构造线段树,使得树根存储整个数组的最大值,左右子树根分别存储左右半边的最大值,以此类推,直到把区间分割到长度为 1 1 1时就是叶子节点。
分治法。先构造左半边的线段树,再构造右半边的线段树,然后new出一个树根,其存储的最大值就是左右两边最大值的较大者,然后将左右子树连到树根上去即可。代码如下:
public class Solution {
/**
* @param A: a list of integer
* @return: The root of Segment Tree
*/
public SegmentTreeNode build(int[] A) {
// write your code here
if (A == null || A.length == 0) {
return null;
}
return dfs(A, 0, A.length - 1);
}
// 返回A[i,..., j]区间对应的线段树根
private SegmentTreeNode dfs(int[] A, int i, int j) {
if (i == j) {
return new SegmentTreeNode(i, j, A[i]);
}
SegmentTreeNode left = dfs(A, i, i + (j - i >> 1));
SegmentTreeNode right = dfs(A, i + (j - i >> 1) + 1, j);
SegmentTreeNode root = new SegmentTreeNode(i, j, Math.max(left.max, right.max));
// 构造完了要连上去
root.left = left;
root.right = right;
return root;
}
}
class SegmentTreeNode {
int start, end, max;
SegmentTreeNode left, right;
public SegmentTreeNode(int start, int end, int max) {
this.start = start;
this.end = end;
this.max = max;
}
}
时间复杂度 O ( l ) O(l) O(l),空间 O ( log l ) O(\log l) O(logl)( l l l为区间长度。空间方面,树节点本身没算进去,只算了递归栈深度)。叶子节点共 l l l个,而二叉树节点总数与叶子节点量级相同。