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

Related Articles

  1. [Daily Problem] Move Zeros
  2. Two-Sum
  3. Spreadsheet Column Title
  4. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  5. Invert a Binary Tree
  6. Detect Linked List Cycle
  7. [Daily Problem] Remove k-th Last Element From Linked List
  8. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  9. First and Last Indices of an Element in a Sorted Array
  10. [Daily Problem] Course Prerequisites

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