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

猜您喜欢...

  1. Daily Interview Problem: Min Stack
  2. YES!!
  3. Algorithm Interview: Level Order Traversal of Binary Tree
  4. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  5. Two-Sum
  6. Daily Interview Question: Longest Sequence with Two Unique Numbers
  7. Spreadsheet Column Title
  8. Skip the readings, focus on problems. And use all the hints!
  9. Two Tricks of Delphi
  10. Daily Interview Problem: Product of Array Except Self

评论 (0)

    当前页暂时没有评论。


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