update

Author: itcuihao

0011.container-with-most-water/README.md

@@ -2,4 +2,6 @@
 
 ```discription
 Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
-```
+```
+
+> 求数组之间最大面积，从数组两端往中间计算

0011.container-with-most-water/run_test.go

@@ -6,7 +6,7 @@ import (
 )
 
 func TestMaxArea(t *testing.T) {
-	height := []int{10, 0, 2}
+	height := []int{10, 10, 2}
 	a := maxArea(height)
 	fmt.Println(a)
 	t.Logf("value:%v", a)