백준 11497 [통나무 건너뛰기] 파이썬

https://www.acmicpc.net/problem/11497

11497번: 통나무 건너뛰기

#백준 11497
import sys
from collections import deque
tc=int(sys.stdin.readline())
for _ in range(tc):
    dq=deque([])
    n=int(sys.stdin.readline())
    lst=list(map(int,sys.stdin.readline().split()))
    lst.sort()
    for i in range(n):
        if i%2==0:
            dq.append(lst.pop())
        else:
            dq.appendleft(lst.pop())
    M=0
    for i in range(n-1):
        M=max(M,abs(dq[i]-dq[i+1]))
    M=max(M,abs(dq[0]-dq[-1]))
    print(M)

#백준 11497 다른풀이

from sys import stdin


t = int(stdin.readline())

for _ in range(t):
    n = int(stdin.readline())
    heights = [int(x) for x in stdin.readline().split()]
    heights.sort()

    max_level = 0
    for i in range(2, n):
        max_level = max(max_level, abs(heights[i] - heights[i - 2]))

    print(max_level)

그리디하게 해결하였다.