[Algorithm] 삼각형의 완성조건 (1)

Mission.

작성한 답

function solution(sides) {
    sides.sort((a, b) => a - b);
    const longestSide = sides[2];
    const sumOfOtherSides = sides[0] + sides[1];
    if (longestSide < sumOfOtherSides) {
        return 1;
    } else {
        return 2;
    }
}

참고 자료

https://school.programmers.co.kr/learn/courses/30/lessons/120889