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 | 606 Views, 18857 Search Bots | 49 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 606 Views, 18857 Search Bots | 49 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 606 Views, 18857 Search Bots | 49 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- [Daily Problem] Angles of a Clock
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Problem: Product of Array Except Self
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Algorithm Interview: Subarray With Target Sum
- Sorting a list with 3 unique numbers
- Daily Interview Question: Word Search
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Count Number of Unival Subtrees
©2006~2024 SteakOverCooked - 0.00772 Seconds(s) - 2443.494 KB/s - 8 Online
Memory: 492.27 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !