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 | 395 Views, 16550 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 | 395 Views, 16550 Search Bots | 49 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Buddy Strings
  2. Daily Interview Problem: Queue Using Two Stacks
  3. Algorithm Interview: Shifted String
  4. Consecutive Ones
  5. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  6. Algorithm Interview: Make the Largest Number
  7. [Daily Problem] Validate Balanced Parentheses
  8. Algorithm Interview: String Compression
  9. Algorithm Interview: Maximum Path Sum in Binary Tree
  10. Maximum In A Stack

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" />