关闭

解题报告:线段树查询 II

标签: 算法动态规划
332人阅读 评论(0) 收藏 举报

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

/**
 * Definition of SegmentTreeNode:
 * class SegmentTreeNode {
 * public:
 *     int start, end, count;
 *     SegmentTreeNode *left, *right;
 *     SegmentTreeNode(int start, int end, int count) {
 *         this->start = start;
 *         this->end = end;
 *         this->count = count;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     *@param root, start, end: The root of segment tree and 
     *                         an segment / interval
     *@return: The count number in the interval [start, end] 
     */ 
   int query(SegmentTreeNode *root, int start, int end) {
	 	// write your code here
	 	if(!root)return 0;
	if (root->start>end)return 0;
		if (root->end < start)return 0;
		if (root->start > start)start = root->start;
		if (root->end < end)end = root->end;
		if (start == root->start&&end == root->end)return root->count;

		SegmentTreeNode *left = root->left, *right = root->right; 
		if (start >= right->start){//完全在右侧
			return query(right, start, end);
		}
		if (end <= left->end){//完全在左侧
			return query(left, start, end);
		}
		return query(left, start, left->end)+query(right,right->start,end);//在左右之间
	} 
};


0
0

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