JAVA_Largest Triangle Area_LeetCode 812 풀이 class Solution { public double largestTriangleArea(int[][] points) { double res = 0; for (int[] i : points){ for (int[] j : points){ for (int[] k : points){ res = Math.max(res, 0.5 * Math.abs(i[0] * j[1] + j[0] * k[1] + k[0] * i[1] - j[0] * i[1] - k[0] * j[1] - i[0] * k[1])); } } } return res; } } 3점 삼각형 넓이 공식을 사용한 문제이다. * 출처 Largest Triangle Area - LeetCode Can you solve this real interview question? Largest Triangle Area - Given an array of points on ...
#
JAVA
#
JAVA_LargestTriangleArea
#
JAVA_LargestTriangleArea_LeetCode812
#
JAVA_LeetCode812
#
LargestTriangleArea_LeetCode812
