【leetcode】295. Find Median from Data Stream

提交代码

class MedianFinder {
	private ArrayList<Integer> nums;
	
    /** initialize your data structure here. */
    public MedianFinder() {
    	nums=new ArrayList<>();
    }
    
    public void addNum(int num) {
    	if(nums.size()==0) {
    		nums.add(num);
    		return;
    	}else if(num<=nums.get(0)) {
    		nums.add(0, num);
    		return;
    	}else if(num>=nums.get(nums.size()-1)) {
    		nums.add(num);
    		return;
    	}
    		for(int i=0;i<=nums.size()-2;i++) {
    			if(num>=nums.get(i)&&num<=nums.get(i+1)) {
    				nums.add(i+1, num);
    				return;
    			}
        	}
    }
    
    public double findMedian() {
        return ( nums.get((nums.size()-1)/2)+nums.get((nums.size())/2))/2.0;
    }
}

运行结果