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

猜您喜欢...

  1. Algorithm Interview Question: Max and Min with Limited Comparisons
  2. Daily Interview Problem: Merge K Sorted Linked Lists
  3. 56 Bytes
  4. Number of Ways to Climb Stairs
  5. Daily Interview Puzzle: Intersection of Linked Lists
  6. Daily Interview Problem: Room scheduling
  7. Algorithm Interview: Make the Largest Number
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Algorithm Interview: Subarray With Target Sum
  10. A trick for getting good at coding interviews FASTER

评论 (0)

    当前页暂时没有评论。


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