页面顶部 Top
文件:  root - text - article - 2019 - 11 - witness.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1951 次阅读, 20720 次搜索 | 94 个单词

定阅此目录的博客 | 浏览 | 博客存档
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
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1951 次阅读, 20720 次搜索 | 94 个单词 定阅此目录的博客

猜您喜欢...

  1. Binary Tree Level with Minimum Sum
  2. Most Frequent Subtree Sum
  3. Algorithm Interview: Level Order Traversal of Binary Tree
  4. Daily Interview Problem: Look and Say Sequence
  5. Find Missing Numbers in an Array
  6. Algorithm Interview: Longest Consecutive Sequence
  7. Daily Interview Problem: Arithmetic Binary Tree
  8. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  9. Daily Interview Problem: Count Number of Unival Subtrees
  10. ImageMagick Vulnerabilities -  CVE-2016–3714

评论 (1)

读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计

    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);
}
} 


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">