https://school.programmers.co.kr/learn/courses/30/lessons/120889
def solution(sides):
tri_check = sum(sides) - max(sides)
if max(sides) < tri_check:
return 1
else:
return 2
def solution(sides):
sides.sort()
return 1 if sides[0] + sides[1] > sides[2] else 2
피드백은 언제나 환영입니다 :)