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

猜您喜欢...

  1. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  2. Daily Interview Problem: Maximum Profit From Stocks
  3. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  4. Algorithm Interview: Level Order Traversal of Binary Tree
  5. Palindrome Integers
  6. [Daily Problem] Remove k-th Last Element From Linked List
  7. Daily Interview Puzzle: Minimum Size Subarray Sum
  8. Invert a Binary Tree
  9. Top K Frequent words
  10. Daily Interview Question: Edit Distance

评论 (0)

    当前页暂时没有评论。


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