java 数据结构源码--线段树

线段树模板

package segmentTree;

public class SegmentTree {
	
	private class Segment {  
        int left;  
        int right;  
        int count;  
        Segment leftChild;  
        Segment rightChild;  
    }  
	
	
	private Segment root;  
    
    public SegmentTree (int left, int right) {  
        root = new Segment();  
        build(root, left, right);  
    }  
      
    public void insert(int left, int right) {  
        insert(root, left, right);  
    }  
      
    public int caculateExistingTimes(int target) {  
        return caculateExistingTimes(root, target);  
    }  
      
    //从根节点开始查找叶子结点[target, target]，对经过的节点的count求和  
    private int caculateExistingTimes(Segment root, int target) {  
        int result = 0;  
        while( root.left != root.right) {  
            int rootMid = root.left + (root.right - root.left) / 2;  
            result += root.count;  
            if (target <= rootMid) {  
                root = root.leftChild;  
            } else if (target > rootMid) {  
                root = root.rightChild;  
            }  
        }  
        return result;  
    }  
     
    private void build(Segment root, int left, int right) {  
        root.left = left;  
        root.right = right;  
        if (left != right) {  
            int mid = left + (right - left) / 2;  
            root.leftChild = new Segment();  
            root.rightChild = new Segment();  
            build(root.leftChild, left, mid);  
            build(root.rightChild, mid + 1, right);  
        }  
    }  
      
    private void insert(Segment root, int left, int right) {  
          
        int rootLeft = root.left;  
        int rootRight = root.right;  
        int rootMid = rootLeft + (rootRight - rootLeft) / 2;  
          
        //匹配，出现次数加1  
        if (left == rootLeft && right == rootRight) {  
            root.count++;  
            return;  
        }  
          
        if (right <= rootMid) {  
            insert(root.leftChild, left, right);  
        } else if (left > rootMid){  
            insert(root.rightChild, left, right);  
        } else {  
            insert(root.leftChild, left, rootMid);  
            insert(root.rightChild, rootMid + 1, right);  
        }  
    }  
	

}

测试源码 test.java

/** 
 * 线段树入门 
 * 问题：已知线段[2,5] [4,6] [0,7]；求点2,4,7分别出现了多少次 
 * 以下代码建立的线段树用链表来保存，且树的叶子结点类似[i,i] 
 */  


package segmentTree;
import segmentTree.SegmentTree;

public class test {
	
	public static void main(String[] args) {  
        SegmentTree tree = new SegmentTree(0, 7);  
        int[][] segments = {  
                {2, 5},   
                {4, 6},   
                {0, 7}  
        };  
        int[] targets = {2, 4, 7};  
        for (int i = 0, len = segments.length; i < len; i++) {  
            int[] segment = segments[i];  
            tree.insert(segment[0], segment[1]);  
        }  
        for(int target : targets) {  
            System.out.println(target + ":" + tree.caculateExistingTimes(target));  
        }  
    }  
	

}