[LintCode] Segment Tree Build
|
1 2 3 4 5 6 7 8 9 10 11 12 |
public SegmentTreeNode build(int start, int end) { // write your code here if(start > end) return null; SegmentTreeNode root = new SegmentTreeNode(start, end); // root if(start < end) { int mid = start + (end - start) / 2; root.left = build(start, mid); root.right = build(mid+1, end); } return root; } |
Leave A Comment