https://programmers.co.kr/learn/courses/30/lessons/86491
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ต์์ง์ฌ๊ฐํ
[[10, 7], [12, 3], [8, 15], [14, 7], [5, 15]] 120 [[14, 4], [19, 6], [6, 16], [18, 7], [7, 11]] 133
programmers.co.kr
ํ์ด
# ํ๋ก๊ทธ๋๋จธ์ค 1๋จ๊ณ - ์ต์ ์ง์ฌ๊ฐํ
def solution(sizes):
w_list = []
h_list = []
answer = 0
temp = 0
for i in range(len(sizes)):
if sizes[i][0] <= sizes[i][1]:
temp = sizes[i][0]
sizes[i][0] = sizes[i][1]
sizes[i][1] = temp
for i in range(len(sizes)):
w_list.append(sizes[i][0])
h_list.append(sizes[i][1])
w = max(w_list)
h = max(h_list)
answer = w * h
return answer