๐Ÿ—๏ธ Algorithm/โฌ› ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

[Programmers] [์œ„ํด๋ฆฌ ์ฑŒ๋ฆฐ์ง€] [Python] Level1_์ตœ์†Œ ์ง์‚ฌ๊ฐํ˜•

Dbswnstjd 2022. 4. 3. 22:36

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