[LintCode]Segment Tree Query 线段树的查询
来源:互联网 发布:什么域名后缀好 编辑:程序博客网 时间:2024/06/05 23:25
For an integer array (index from 0 to n-1, where n is the size of this array), in the corresponding SegmentTree, each node stores an extra attribute max to denote the maximum number in the interval of the array (index from start to end).
Design a query method with three parameters root, start and end, find the maximum number in the interval [start, end] by the given root of segment tree.
Example
For array [1, 4, 2, 3], the corresponding Segment Tree is:
[0, 3, max=4] / \ [0,1,max=4] [2,3,max=3] / \ / \[0,0,max=1] [1,1,max=4] [2,2,max=2], [3,3,max=3]
query(root, 1, 1), return 4
query(root, 1, 2), return 4
query(root, 2, 3), return 3
query(root, 0, 2), return 4
Note
It is much easier to understand this problem if you finished Segment Tree Build first.
/** * Definition of SegmentTreeNode: * public class SegmentTreeNode { * public int start, end, max; * public SegmentTreeNode left, right; * public SegmentTreeNode(int start, int end, int max) { * this.start = start; * this.end = end; * this.max = max * this.left = this.right = null; * } * } */public class Solution { /** *@param root, start, end: The root of segment tree and * an segment / interval *@return: The maximum number in the interval [start, end] */ public int query(SegmentTreeNode root, int start, int end) { if(null == root) return Integer.MIN_VALUE; if(root.start > end || root.end < start || start > end) return Integer.MIN_VALUE; if(root.start >= start && root.end <= end) return root.max; int mid = root.start + (root.end - root.start)/2; int leftmax = query(root.left, start, Math.min(mid, end)); int rightmax = query(root.right, Math.max(mid, start), end); return Math.max(leftmax, rightmax); }}
0 0
- [LintCode]Segment Tree Query 线段树的查询
- lintcode segment-tree-query 线段树的查询
- [LintCode]Segment Tree Build 构造线段树
- Lintcode - Segment Tree Query
- 202.Segment Tree Query-线段树的查询(中等题)
- lintcode segment-tree-build 线段树的构造
- lintcode segment-tree-modify 线段树的修改
- [Lintcode]Segment Tree Query II
- 247.Segment Tree Query II-线段树查询 II(中等题)
- 线段树(segment tree)
- 线段树(segment tree)
- 线段树(segment tree)
- 线段树(segment tree)
- 线段树(segment tree)
- 线段树(segment tree)
- segment tree(线段树)
- LintCode:线段树的查询
- 线段树的查询-LintCode
- 人生之路
- hibernate三种状态之间的转换
- 如何撰写PRD(一)
- LNMP被挂马自己动手解决
- jrtplib 在vs2010中的移植
- [LintCode]Segment Tree Query 线段树的查询
- POJ - 3109Inner Vertices
- scicos仿真系统
- vivi.c中的调用流程
- Android 学习 AIDL 的使用
- linux设置时间为24小时制,设置时区
- 我的站内小资源
- git 提交
- JS 中如何判断 undefined和null