[Python] SWEA D3 : 1206 - [S/W 문제해결 기본] 1일차 - View

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1&&&&&&&&&&

SW Expert Academy

---

📌 작성한 풀이 1 (통과)

for T in range(1,11):
    n = int(input())
    arr = list(map(int,input().split()))
    building = 0
    for i in range(2,n-2):
        temp1 = 0
        temp2 = 0
       
        if arr[i] <= arr[i-1] or arr[i] <= arr[i-2]:
            continue
        elif arr[i-2] > arr[i-1]:
            temp1 = arr[i] - arr[i-2]
        else:
            temp1 = arr[i] - arr[i-1]
        
        if arr[i] <= arr[i+1] or arr[i] <= arr[i+2]:
            continue
        elif arr[i+2] > arr[i+1]:
            temp2 = arr[i] - arr[i+2]
        else:
            temp2 = arr[i] - arr[i+1]
        
        building += min(temp1, temp2)
    print(f'#{T} {building}')

 

 

📌 작성한 풀이 2 (통과, 리팩토링)

for T in range(1,11):
    n = int(input())
    arr = list(map(int,input().split()))
    building = 0
    for i in range(2,n-2):
        max_height = max(arr[i-1], arr[i-2], arr[i+1], arr[i+2])
        if max_height < arr[i]:
            building += arr[i] - max_height
        
    print(f'#{T} {building}')