To the Top
File:  root - text - article - 2019 - 11 - tapping-rainwater.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 439 Views, 15541 Search Bots | 85 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 439 Views, 15541 Search Bots | 85 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Count Number of Unival Subtrees
  2. Find the non-duplicate number
  3. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  4. Batch Programming in XP
  5. Skip the readings, focus on problems. And use all the hints!
  6. Autorun.inf Virus Protection
  7. Daily Interview Problem: Largest BST in a Binary Tree
  8. Daily Interview Problem: Deepest Node in a Binary Tree
  9. Daily Interview Problem: Merge K Sorted Linked Lists
  10. Spectrum Master

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />