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

Related Articles

  1. Daily Interview Question: Edit Distance
  2. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  3. Algorithm Interview: Permutations of numbers
  4. Daily Interview Question: Find Cycles in a Graph
  5. Algorithm Interview: Subarray With Target Sum
  6. Daily Interview Problem: Longest Substring With K Distinct Characters
  7. Skip the readings, focus on problems. And use all the hints!
  8. Daily Interview Problem: Look and Say Sequence
  9. Daily Interview Question: Longest Sequence with Two Unique Numbers
  10. Daily Interview Puzzle: Falling Dominoes

Comments (1)

Read & Write - Normal - Mini - Post - All Comments - Statistics

    1.     - 2021-07-05 09:05:17 AM
 public class Main {
public static void main(String[] args) {
System.out.println("Hello World!");
int[] input = {8, 2, 3, 4, 0};
int n = input.length;
int witness = 0;
int max_so_far = Integer.MIN_VALUE;
for(int i = n-1 ; i >= 0 ; i--){
if(input[i] > max_so_far){
witness++;
max_so_far = input[i];
}
}
System.out.println(witness);
}
} 


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