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

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Uber:

You have a landscape, in which puddles can form. You are given an array of non-negative integers representing the elevation at each location. Return the amount of water that would accumulate if it rains.

For example: [0,1,0,2,1,0,1,3,2,1,2,1] should return 6 because 6 units of water can get trapped here.

X
X███XX█X
X█XX█XXXXXX
# [0,1,0,2,1,0,1,3,2,1,2,1]


Here's your starting pont:

def capacity(arr):
# Fill this in.

print capacity([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])
# 6
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 443 次阅读, 15980 次搜索 | 85 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  2. [Daily Problem] Validate Balanced Parentheses
  3. [Daily Problem] Longest Increasing Subsequence
  4. Algorithm Interview: Permutations of numbers
  5. Longest Substring Without Repeating Characters
  6. Patterns for breaking down questions you haven
  7. Fix Brackets
  8. Plus One
  9. Absolute Path
  10. Number of Ways to Climb Stairs

评论 (0)

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

您的评论:

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

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

    当前页暂时没有评论。


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