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

Related Articles

  1. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  2. A trick for getting good at coding interviews FASTER
  3. Daily Interview Problem: Running Median
  4. Progess made
  5. Daily Interview Problem: Circle of Chained Words
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. Daily Interview Problem: Largest Product of 3 Elements I
  8. Invert a Binary Tree
  9. Daily Interview Question: Longest Sequence with Two Unique Numbers
  10. Algorithm Interview: Determine If Linked List is Palindrome

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