812 added

Author: aQua

Algorithms/0812.largest-triangle-area/README.md

@@ -0,0 +1,26 @@
+# [812. Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/)
+
+## 题目
+
+You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points.
+
+```text
+Example:
+Input: points = [[0,0],[0,1],[1,0],[0,2],[2,0]]
+Output: 2
+Explanation:
+The five points are show in the figure below. The red triangle is the largest.
+```
+
+![pic](pic.png)
+
+Notes:
+
+1. 3 <= points.length <= 50.
+1. No points will be duplicated.
+1. -50 <= points[i][j] <= 50.
+1. Answers within 10^-6 of the true value will be accepted as correct.
+
+## 解题思路
+
+见程序注释

Algorithms/0812.largest-triangle-area/largest-triangle-area.go

@@ -0,0 +1,6 @@
+package problem0812
+
+func largestTriangleArea(points [][]int) float64 {
+    
+	return 0
+}

Algorithms/0812.largest-triangle-area/largest-triangle-area_test.go

@@ -0,0 +1,39 @@
+package problem0812
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	points [][]int
+	ans    float64
+}{
+
+	{
+		[][]int{{0, 0}, {0, 1}, {1, 0}, {0, 2}, {2, 0}},
+		2,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_largestTriangleArea(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, largestTriangleArea(tc.points), "输入:%v", tc)
+	}
+}
+
+func Benchmark_largestTriangleArea(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			largestTriangleArea(tc.points)
+		}
+	}
+}

Algorithms/0812.largest-triangle-area/pic.png

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 1351,
-	"Updated": "2018-04-20T16:18:33.801050673+08:00",
+	"Updated": "2018-04-20T16:53:01.137780299+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 165,