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

Related Articles

  1. Daily Interview Problem: Largest Product of 3 Elements I
  2. Algorithm Interview Question: Max and Min with Limited Comparisons
  3. Daily Interview Problem: Buddy Strings
  4. [Daily Problem] Validate Balanced Parentheses
  5. Daily Interview Problem: Largest BST in a Binary Tree
  6. Daily Interview Problem: Jump to the End
  7. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  8. Algorithm Interview Question: Symmetric k-ary Tree
  9. Daily Interview Puzzle: Minimum Size Subarray Sum
  10. Skip the readings, focus on problems. And use all the hints!

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