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 | 446 Views, 16524 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 | 446 Views, 16524 Search Bots | 85 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Distribute Bonuses
  2. Print a tree level-by-level, with line-breaks
  3. Patterns for breaking down questions you haven
  4. Fibonacci coding
  5. Find Missing Numbers in an Array
  6. Generate All IP Addresses
  7. Find Pythagorean Triplets
  8. Daily Interview Problem: Find the k-th Largest Element in a List
  9. A trick for getting good at coding interviews FASTER
  10. Progess made

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" />