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

    package LeetCode_295
    
    import java.util.*
    
    /**
     * 295. Find Median from Data Stream
     * https://leetcode.com/problems/find-median-from-data-stream/description/
     *
     * 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:
    If all integer numbers from the stream are between 0 and 100, how would you optimize it?
    If 99% of all integer numbers from the stream are between 0 and 100, how would you optimize it?
     * */

    /* * solution: Tow PriorityQueue, minHeap and maxHeap, Time complexity: O(nlogn), Space complexity:O(1) * get element from PriorityQueu is O(1), * add new element in PriorityQueu is O(logn) * */ class MedianFinder() { /** initialize your data structure here. */ //change to max heap, because PriorityQueue in kotlin default is Min Heap val leftHeap = PriorityQueue<Int>{ a, b -> b - a } //min heap val rightHeap = PriorityQueue<Int>() fun addNum(num: Int) { if (leftHeap.isEmpty() || num < leftHeap.peek()) { leftHeap.offer(num) } else { rightHeap.offer(num) } //balance minHeap and maxHeap //the size of minHeap just can larger than the size fo maxHeap by 1 if (leftHeap.size < rightHeap.size) { leftHeap.offer(rightHeap.poll()) } else if (leftHeap.size - rightHeap.size == 2) { rightHeap.offer(leftHeap.poll()) } } fun findMedian(): Double { if (leftHeap.size>rightHeap.size){ return leftHeap.peek().toDouble() } else { val left = leftHeap.peek().toDouble() val right = rightHeap.peek().toDouble() return (left+right)/2 } } } /** * Your MedianFinder object will be instantiated and called as such: * var obj = MedianFinder() * obj.addNum(num) * var param_2 = obj.findMedian() */
  • 相关阅读:
    在主窗体中打开一个新子窗体,如果已有子窗体,则激活它,而不打开新的。
    文本的追加
    男人至少的品质底线
    做人,做事,生活,学习,爱情>人生
    日常中一些好用的小软件
    ◆2008 年广告创意设计师必备网址汇总◆
    在SharePoint中更改当前登录用户的密码
    SONY笔记本VGNSZ65装VISTA记
    Outlook收邮件速度超慢的原因
    Cisco路由器做限速
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/13233438.html
Copyright © 2011-2022 走看看