关闭

解题报告:线段树的查询

294人阅读 评论(0) 收藏 举报

http://www.lintcode.com/zh-cn/problem/segment-tree-query/

/**
 * 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 root, start, end: The root of segment tree and 
     *                         an segment / interval
     *@return: The maximum number in the interval [start, end]
     */
    int query(SegmentTreeNode *root, int start, int end) {
        // write your code here
       if (root == nullptr)return 0;
		SegmentTreeNode *left = root->left, *right = root->right;
		if (end<root->start)return 0;//end超出了最左
		if (start>root->end)return 0;//start超出了最右
		if (start<root->start)start = left->start;//start超出了最左
		if (end>root->end)end = right->end;//end超出了最右
		if (start == root->start&&end == root->end)return root->max;
		if (left->end >= end){//完全左侧
			return query(left, start, end);
		}
		if (right->start <= start){//完全右侧
			return query(right, start, end);
		}
		return  max(query(left, start, left->end), query(right, right->start, end));//左右之间都有
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:54874次
    • 积分:1559
    • 等级:
    • 排名:千里之外
    • 原创:102篇
    • 转载:1篇
    • 译文:0篇
    • 评论:8条
    最新评论