import java.util.Arrays;
class Solution {
public int solution(int[][] dots) {
int answer = 0;
//dots 정렬
Arrays.sort(dots, (o1, o2) -> o1[0] != o2[0] ? o1[0] - o2[0] : o1[1] - o2[1]);
// System.out.println(Arrays.deepToString(dots));
answer = (dots[2][0] - dots[0][0]) * (dots[1][1] - dots[0][1]);
return answer;
}
}
이차원 배열 오름차순으로 정렬이 key point>
Arrays.sort(dots, (o1, o2) -> o1[0] != o2[0] ? o1[0] - o2[0] : o1[1] - o2[1]);