solves largest triangle area

Author: anishLearnsToCode

Diff for: README.md

@@ -1,7 +1,7 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-189/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-189/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-190/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-190/2081-1abc9c.svg)
 ![problems-solved-python](https://img.shields.io/badge/Python-186/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
@@ -219,7 +219,7 @@
 | 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [![Java](assets/java.png)](src/UniqueMorseCodeWords.java) |
 | 806 | [Number of Lines to Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [![Java](assets/java.png)](src/NumberOfLinesToWriteInString.java) |
 | 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | |
-| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | |
+| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [![Java](assets/java.png)](src/LargestTriangleArea.java) |
 | 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | |
 | 821 | [Shortest Distance to Character](https://leetcode.com/problems/shortest-distance-to-a-character) | |
 | 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | |

Diff for: src/LargestTriangleArea.java

@@ -0,0 +1,19 @@
+public class LargestTriangleArea {
+    public double largestTriangleArea(int[][] points) {
+        double result = 0;
+        for (int i = 0 ; i < points.length ; i++) {
+            for (int j = i + 1 ; j < points.length ; j++) {
+                for (int k = j + 1 ; k < points.length ; k++) {
+                    result = Math.max(result, triangleArea(points[i], points[j], points[k]));
+                }
+            }
+        }
+        return result;
+    }
+
+    private double triangleArea(int[] p1, int[] p2, int[] p3) {
+        return 0.5 * Math.abs(
+                p1[0] * p2[1] + p2[0] * p3[1] + p3[0] * p1[1]- p2[0] * p1[1] - p3[0] * p2[1] - p1[0] * p3[1]
+        );
+    }
+}