页面顶部 Top
文件:  root - text - article - 2019 - 12 - running-median.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 368 次阅读, 15617 次搜索 | 49 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:

You are given a stream of numbers. Compute the median for each new element .

Eg. Given [2, 1, 4, 7, 2, 0, 5], the algorithm should output [2, 1.5, 2, 3.0, 2, 2, 2]

Here's a starting point:


def running_median(stream):
# Fill this in.

running_median([2, 1, 4, 7, 2, 0, 5])
# 2 1.5 2 3.0 2 2.0 2
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 368 次阅读, 15617 次搜索 | 49 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Find the Number of Islands
  2. Daily Interview Question: Edit Distance
  3. Algorithm Interview: Level Order Traversal of Binary Tree
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. [Daily Problem] Witness of The Tall People
  6. Consecutive Ones
  7. Daily Interview Problem: Spiral Traversal of Grid
  8. Algorithm Interview: String Compression
  9. First and Last Indices of an Element in a Sorted Array
  10. Daily Interview Problem: Arithmetic Binary Tree

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />