zoukankan      html  css  js  c++  java
  • LeetCode-295. Find Median from Data Stream

    Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

    For example,

    [2,3,4], the median is 3

    [2,3], the median is (2 + 3) / 2 = 2.5

    Design a data structure that supports the following two operations:

    • void addNum(int num) - Add a integer number from the data stream to the data structure.
    • double findMedian() - Return the median of all elements so far.

    Example:

    addNum(1)
    addNum(2)
    findMedian() -> 1.5
    addNum(3) 
    findMedian() -> 2

    Follow up:

    1. If all integer numbers from the stream are between 0 and 100, how would you optimize it?
    2. If 99% of all integer numbers from the stream are between 0 and 100, how would you optimize it?
    class MedianFinder {
    
        int count ;
        PriorityQueue<Integer> minHeap;
        PriorityQueue<Integer> maxHeap;
        /** initialize your data structure here. */
        public MedianFinder() {
            count=0;
            minHeap = new PriorityQueue<>();
            maxHeap = new PriorityQueue<>(new Comparator<Integer>(){
                public int compare(Integer o1,Integer o2){
                    return o2-o1;
                }
            });
        }
        
        public void addNum(int num) {
            if((count&1)==0){
                maxHeap.offer(num);
                int n = maxHeap.poll();
                minHeap.offer(n);
            }
            else{
                minHeap.offer(num);
                int n= minHeap.poll();
                maxHeap.offer(n);
            }
            count++;
        }
        
        public double findMedian() {
            if(count==0){
                return 0.0;
            }
            if((count&1)==0){
                return (minHeap.peek()+maxHeap.peek())/2.0;
            }
            else{
                return minHeap.peek()*1.0;
            }
        }
    }
  • 相关阅读:
    1分钟去除word文档编辑限制密码
    建行信用卡微信查询
    明目地黄丸
    发动机启停技术
    ORA-12170: TNS: 连接超时
    螃蟹放进冰箱冷冻保存前,要注意什么呢?
    螃 蟹要蒸多久
    总胆固醇偏高的注意措施及治疗方法
    codeforces 375D . Tree and Queries 启发式合并 || dfs序+莫队
    codeforces 374D. Inna and Sequence 线段树
  • 原文地址:https://www.cnblogs.com/zhacai/p/11204420.html
Copyright © 2011-2022 走看看