页面顶部 Top
文件:  root - text - article - 2019 - 11 - witness.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1956 次阅读, 20946 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 1956 次阅读, 20946 次搜索 | 94 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Sort Colors
  2. Daily Interview Problem: Count Number of Unival Subtrees
  3. Daily Interview Problem: Reverse Words in a String
  4. Algorithm Interview: Permutations of numbers
  5. Daily Interview Problem: Largest BST in a Binary Tree
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. Most Frequent Subtree Sum
  8. A trick for getting good at coding interviews FASTER
  9. Daily Interview Question: Word Search
  10. Daily Interview Problem: Given two arrays, write a function to compute their intersection.

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