lintcode segment-tree-build 线段树的构造

问题描述

lintcode

笔记

把中间点算出来，然后使用递归构造。要注意start > end的情况。

代码

/**
 * Definition of SegmentTreeNode:
 * class SegmentTreeNode {
 * public:
 *     int start, end;
 *     SegmentTreeNode *left, *right;
 *     SegmentTreeNode(int start, int end) {
 *         this->start = start, this->end = end;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     *@param start, end: Denote an segment / interval
     *@return: The root of Segment Tree
     */
    SegmentTreeNode * build(int start, int end) {
        // write your code here
        if (start > end)
        {
            return NULL;
        }
        SegmentTreeNode* root = new SegmentTreeNode(start, end);
        if (start == end)
            return root;
        else
        {
            root->left = build(start, (start+end)/2);
            root->right = build((start+end)/2+1, end);
            return root;
        }

    }
};