Clean the codes

Author: jameszhan

README.md

@@ -83,7 +83,7 @@ LeetCode
 | 171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [Python](algorithms/171-excel-sheet-column-number.py)|Easy|
 | 169|[Majority Element](https://leetcode.com/problems/majority-element/) | [Python](algorithms/169-majority-element.py)|Easy|
 | 168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | [Python](algorithms/168-excel-sheet-column-title.ipynb)|Easy|
-| 167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) ♥ | [Python](algorithms/167-two-sum-ii-input-array-is-sorted.ipynb)|Medium|
+| 167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Python](algorithms/167-two-sum-ii-input-array-is-sorted.ipynb)|Medium|
 | 160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Python](algorithms/160-intersection-of-two-linked-lists.ipynb)|Easy|
 | 152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Python](algorithms/152-maximum-product-subarray.py)|Medium|
 | 150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Python](algorithms/150-evaluate-reverse-polish-notation.ipynb)|Medium|

algorithms/042-trapping-rain-water.go

@@ -35,32 +35,12 @@ func trap(heights []int) int64 {
 	}
 
 	ans := 0
-	for i := 1; i < n -1; i++ {
-	    h := min(lefts[i], rights[i])
-	    if h > heights[i] {
-	        ans += h - heights[i]
-        }
-    }
+	for i := 1; i < n-1; i++ {
+		h := min(lefts[i], rights[i])
+		if h > heights[i] {
+			ans += h - heights[i]
+		}
+	}
 
 	return int64(ans)
 }
-
-//
-//total, length = 0, len(heights)
-//if length <= 2:
-//    return 0
-//max_left, max_right = [0 for _ in range(length)], [0 for _ in range(length)]
-//# max_left[0] = heights[0]
-//# max_right[length - 1] = heights[length - 1]
-//
-//for i in range(1, length):
-//    max_left[i] = max(max_left[i - 1], heights[i - 1])
-//for i in reversed(range(0, length - 1)):
-//    max_right[i] = max(max_right[i + 1], heights[i + 1])
-//
-//for i in range(1, length - 1):
-//    m = min(max_left[i], max_right[i])
-//    if m > heights[i]:
-//        total += (m - heights[i])
-//
-//return total