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

Related Articles

  1. [Daily Problem] Longest Increasing Subsequence
  2. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  3. Staying on a Chess Board
  4. Daily Interview Problem: Product of Array Except Self
  5. Daily Interview Problem: Merge List Of Number Into Ranges
  6. First and Last Indices of an Element in a Sorted Array
  7. Sort a Partially Sorted List
  8. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  9. Delphi Dynamic Array
  10. Daily Interview Problem: Jump to the End

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