File: root - text - article - 2019 - 11 - witness.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1956 Views, 21003 Search Bots | 94 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1956 Views, 21003 Search Bots | 94 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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.
Here's your starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1956 Views, 21003 Search Bots | 94 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Kaprekar
- Daily Interview Problem: Validate Binary Search Tree
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- Algorithm Interview: No Adjacent Repeating Characters
- Detect Linked List Cycle
- Maximum In A Stack
- Daily Interview Problem: Merge K Sorted Linked Lists
- Daily Interview Problem: Circle of Chained Words
- Generate All IP Addresses
- Daily Interview Puzzle: Intersection of Linked Lists
©2006~2024 SteakOverCooked - 0.01467 Seconds(s) - 3814.167 KB/s - 41 Online
Memory: 569.4 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
1. ekta12bhaskar - 2021-07-05 09:05:17 AM
public class Main { ![](/images/datacss/rightq.png)
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);
}
}