g0201_0300.s0295_find_median_from_data_stream.MedianFinder.cs Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

namespace LeetCodeNet.G0201_0300.S0295_find_median_from_data_stream {

// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design
// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n)
// #2024_01_11_Time_658_ms_(24.88%)_Space_144_MB_(5.64%)

using System;
using System.Collections.Generic;

public class MedianFinder {
    private PriorityQueue left = new();
    private PriorityQueue right = new();
    private bool odd = false;

    public void AddNum(int n) {
        odd = !odd;
        int m = right.EnqueueDequeue(n, -n);
        left.Enqueue(m, m);     
        if (left.Count - 1 > right.Count) {
            m = left.Dequeue();
            right.Enqueue(m, -m);
        }
    }
    
    public double FindMedian() =>
        odd ? left.Peek() : (left.Peek() + right.Peek()) / 2.0;
}

/**
 * Your MedianFinder object will be instantiated and called as such:
 * MedianFinder obj = new MedianFinder();
 * obj.AddNum(num);
 * double param_2 = obj.FindMedian();
 */
}