We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Heaps: Find the Running Median
  2. Discussions

Heaps: Find the Running Median

  • zhaozhiyong
     + 0 comments

    Thanks for the inspiration, your code is very neat!! In my humble view, balance can be optimized a little bit:)

    //Balance O(1)
    static void balance(){
        if(Math.abs(low.size() - high.size()) > 1){
            if(low.size() > high.size()){
                high.add(low.poll());                
            }else{
                low.add(high.poll());
            }
        }
    }