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

猜您喜欢...

  1. Algorithm Interview: Subarray With Target Sum
  2. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  3. Detect Linked List Cycle
  4. Algorithm Interview: String Compression
  5. Daily Interview Problem: Buddy Strings
  6. Daily Interview Problem: Find the Number of Islands
  7. Maximum In A Stack
  8. Daily Interview Question: Find Cycles in a Graph
  9. Algorithm Interview: Longest Consecutive Sequence
  10. Generate All IP Addresses

评论 (1)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):


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