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

Related Articles

  1. Daily Interview Problem: Group Words that are Anagrams
  2. [Daily Problem] Remove k-th Last Element From Linked List
  3. Daily Interview Problem: 3 Sum
  4. Daily Interview Problem: Maximum Profit From Stocks
  5. Daily Interview Problem: Tree Serialization
  6. Floor and Ceiling of a Binary Search Tree
  7. Algorithm Interview: Maximum Path Sum in Binary Tree
  8. Making a Height Balanced Binary Search Tree
  9. Reverse a Directed Graph
  10. Daily Interview Problem: Deepest Node in a Binary Tree

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="index, follow">