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 | 1909 Views, 19860 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 | 1909 Views, 19860 Search Bots | 94 Words Subscribe to Feed Burner

Related Articles

  1. Find Missing Numbers in an Array
  2. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  3. Algorithm Interview: Shifted String
  4. Daily Interview Problem: Find the k-th Largest Element in a List
  5. Daily Interview Question: Longest Sequence with Two Unique Numbers
  6. Daily Interview Problem: Queue Using Two Stacks
  7. Algorithm Interview Question: Symmetric k-ary Tree
  8. Daily Interview Problem: Maximum Profit From Stocks
  9. Invert a Binary Tree
  10. Algorithm Interview: Make the Largest Number

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