File: root - text - article - 2019 - 11 - witness.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1965 Views, 22139 Search Bots | 94 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 | 1965 Views, 22139 Search Bots | 94 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:
There are n people lined up, and each have a height represented as an integer. A murder has happened right in front of them, and only people who are taller than everyone in front of them are able to see what has happened. How many witnesses are there?
Example:
Input: [3, 6, 3, 4, 1]
Output: 3
Explanation: Only [6, 4, 1] were able to see in front of them.
Here's your starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1965 Views, 22139 Search Bots | 94 Words There are n people lined up, and each have a height represented as an integer. A murder has happened right in front of them, and only people who are taller than everyone in front of them are able to see what has happened. How many witnesses are there?
Example:
Input: [3, 6, 3, 4, 1]
Output: 3
Explanation: Only [6, 4, 1] were able to see in front of them.
#
#
# #
####
####
#####
36341 x (murder scene)
Here's your starting point:
def witnesses(heights):
# Fill this in.
print witnesses([3, 6, 3, 4, 1])
# 3
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Number of Ways to Climb Stairs
- Algorithm Interview: Determine If Linked List is Palindrome
- Non-decreasing Array with Single Modification
- Daily Interview Problem: Running Median
- Patterns for breaking down questions you haven
- Daily Interview Problem: Full Binary Tree
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Algorithm Interview: No Adjacent Repeating Characters
- Spreadsheet Column Title
- Daily Interview Problem: Jump to the End
©2006~2024 SteakOverCooked - 0.01335 Seconds(s) - 4082.151 KB/s - 20 Online
Memory: 517.96 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