Package g0001_0100.s0042_trapping_rain_water

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    42 - Trapping Rain Water\.

    Hard

    Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

    Example 1:

    Input: height = 0,1,0,2,1,0,1,3,2,1,2,1

    Output: 6

    Explanation: The above elevation map (black section) is represented by array 0,1,0,2,1,0,1,3,2,1,2,1. In this case, 6 units of rain water (blue section) are being trapped.

    Example 2:

    Input: height = 4,2,0,3,2,5

    Output: 9

    Constraints:

    • n == height.length

    • <code>1 <= n <= 2 * 10<sup>4</sup></code>

    • <code>0 <= heighti<= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer trap(IntArray height)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait