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

Related Articles

  1. [Daily Problem] Longest Palindromic Substring
  2. Algorithm Interview: Longest Consecutive Sequence
  3. Floor and Ceiling of a Binary Search Tree
  4. Daily Interview Problem: Trapping Rainwater
  5. Daily Interview Problem: Longest Substring With K Distinct Characters
  6. Daily Interview Problem: Buddy Strings
  7. Daily Interview Problem: Decode String
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  10. Daily Interview Puzzle: Falling Dominoes

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