1005. Largest Triangle Area

class Solution { public: /** * @param points: List[List[int]] * @return: return a double */ double largestTriangleArea(vector<vector<int>> &points) { // write your code here int size = points.size(); if(size < 3){ return 0; } double res = 0; for(int i = 0; i < size - 2; i++){ for(int j = i + 1; j < size - 1; j++){ for(int k = i + 2; k < size; k++){ res = max(res, getArea(points[i], points[j], points[k])); } } } return res; } double getArea(vector<int> &pt1, vector<int> &pt2, vector<int> &pt3){ return abs((pt1[0] * (pt2[1] - pt3[1]) + pt2[0]*(pt3[1] - pt1[1]) + pt3[0]*(pt1[1] - pt2[1])) / 2.0); } };