Update 42.trapping-rain-water.md

problems/42.trapping-rain-water.md

@@ -59,28 +59,6 @@ for(let i = 0; i < height.length; i++) {
  *
  * [42] Trapping Rain Water
  *
- * https://leetcode.com/problems/trapping-rain-water/description/
- *
- * algorithms
- * Hard (42.06%)
- * Total Accepted:    278.1K
- * Total Submissions: 651.6K
- * Testcase Example:  '[0,1,0,2,1,0,1,3,2,1,2,1]'
- *
- * Given n non-negative integers representing an elevation map where the width
- * of each bar is 1, compute how much water it is able to trap after raining.
- * 
- * 
- * The above elevation map 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. Thanks
- * Marcos for contributing this image!
- * 
- * Example:
- * 
- * 
- * Input: [0,1,0,2,1,0,1,3,2,1,2,1]
- * Output: 6
- * 
  */
 /**
  * @param {number[]} height