439. Segment Tree Build II (线段树经典题)

439. Segment Tree Build II
     中文English
     The structure of Segment Tree is a binary tree which each node has two attributes start and end denote an segment / interval.

start and end are both integers, they should be assigned in following rules:

The root’s start and end is given by build method.
The left child of node A has start=A.left, end=(A.left + A.right) / 2.
The right child of node A has start=(A.left + A.right) / 2 + 1, end=A.right.
if start equals to end, there will be no children for this node.
Implement a build method with a given array, so that we can create a corresponding segment tree with every node value represent the corresponding interval max value in the array, return the root of this segment tree.

Example
Input: [3,2,1,4]
Explanation:
The segment tree will be
0,3
/
[0,1] [2,3]
(max=3) (max=4)
/ \ / \
[0,0] [1,1] [2,2] [3,3]
(max=3)(max=2) (max=1)(max=4)
Clarification
Segment Tree (a.k.a Interval Tree) is an advanced data structure which can support queries like:

which of these intervals contain a given point
which of these points are in a given interval
See wiki:
Segment Tree
Interval Tree

解法1： 递归

/**
 * Definition of SegmentTreeNode:
 * class SegmentTreeNode {
 * public:
 *     int start, end, max;
 *     SegmentTreeNode *left, *right;
 *     SegmentTreeNode(int start, int end, int max) {
 *         this->start = start;
 *         this->end = end;
 *         this->max = max;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param A: a list of integer
     * @return: The root of Segment Tree
     */
    SegmentTreeNode * build(vector<int> &A) {
        int n = A.size();
        if (n == 0) return NULL;
        return helper(A, 0, n - 1);
    }
    
private:
    SegmentTreeNode * helper(vector<int> &A, int start, int end) {
        if (start > end) return NULL;
        if (start == end) return new SegmentTreeNode(start, end, A[start]);
        int mid = start + (end - start) / 2;
        SegmentTreeNode * node = new SegmentTreeNode(start, end, A[start]);
        node->left = helper(A, start, mid);
        node->right = helper(A, mid + 1, end);
        node->max = max(node->left->max, node->right->max);
        return node;
    }
};

注意：node->max可以初始化为任何值比如0，因为后面还要更新的。

class Solution {
public:
    /**
     * @param A: a list of integer
     * @return: The root of Segment Tree
     */
    SegmentTreeNode * build(vector<int> &A) {
        // write your code here    SegmentTreeNode * build(int start, int end) {
       return buildTree(A, 0, A.size() - 1);
    }

private:
   SegmentTreeNode * buildTree(vector<int> & A, int start, int end) {
        if (start > end) return NULL;
        SegmentTreeNode * pNode = new SegmentTreeNode(start, end, 0);
        if (start == end) {
            pNode->max = A[start];
            return pNode;
        }
        int mid = start + (end - start) / 2;
        pNode->left = buildTree(A, start, mid);
        pNode->right = buildTree(A, mid + 1, end);
        pNode->max = max(pNode->left->max, pNode->right->max);
        return pNode;
   }
};