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

Subscribe to Feed Burner | Browse | Archive
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.


#
#
# #
####
####
#####
36341 x (murder scene)


Here's your starting point:


def witnesses(heights):
# Fill this in.

print witnesses([3, 6, 3, 4, 1])
# 3
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1959 Views, 21912 Search Bots | 94 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Puzzle: Falling Dominoes
  2. Invert a Binary Tree
  3. Daily Interview Problem: Running Median
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. Most Frequent Subtree Sum
  6. How to Play WAV music under DOS?
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. Daily Interview Problem: Circle of Chained Words
  9. Daily Interview Problem: Longest Substring With K Distinct Characters
  10. Reverse a Linked List

Comments (1)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):


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