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.
Input: Integer array height of length n.
Output: Integer — total water trapped.
Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: 6 units of water trapped.Input: [4,2,0,3,2,5]
Output: 9
Explanation: 9 units trapped.Input: [1,0,1]
Output: 1
Explanation: 1 unit between height 1 bars.n==height.length1<=n<=2*10^40<=height[i]<=10^5