To the Top
File:  root - text - article - 2019 - 12 - running-median.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 665 Views, 19096 Search Bots | 49 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 665 Views, 19096 Search Bots | 49 Words Subscribe to Feed Burner

Related Articles

  1. Autorun.inf Virus Protection
  2. Daily Interview Problem: Longest Substring With K Distinct Characters
  3. [Daily Problem] Add two numbers as a linked list
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. Two Tricks of Delphi
  6. PHP Unit Tests on VPS Server
  7. Kaprekar
  8. Binary Tree Level with Minimum Sum
  9. Daily Interview Question: Longest Sequence with Two Unique Numbers
  10. Daily Interview Problem: Contiguous Subarray with Maximum Sum

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />