11497_통나무 건너뛰기[백준_S1]

"""
 *packageName    : 
 * fileName       : 11497_통나무_건너뛰기_S1
 * author         : qkrtk
 * date           : 2022-03-19
 * description    :
 * ===========================================================
 * DATE              AUTHOR             NOTE
 * -----------------------------------------------------------
 * 2022-03-19        qkrtk       최초 생성
 """
import sys


def Solution(wood_count, wood_height_list):
      print("wood_count : %s " % wood_count)
      print("wood_height_list : %s " % wood_height_list)
      wood_height_copy_list = []
      wood_height_diff = []
      if len(wood_height_list) % 2 == 0:
            wood_height_copy_list.extend(wood_height_list[0::2])
            wood_height_copy_list.extend(wood_height_list[-1::-2])

      else:
            wood_height_copy_list.extend(wood_height_list[0::2])
            wood_height_copy_list.extend(wood_height_list[-2::-2])

      print("wood_height_copy_list : %s " % wood_height_copy_list)

      for index, num in enumerate(wood_height_copy_list):
            if index == len(wood_height_copy_list) - 1:
                  wood_height_diff.append(abs(wood_height_copy_list[index] - wood_height_copy_list[0]))
            else:
                  wood_height_diff.append(abs(wood_height_copy_list[index] - wood_height_copy_list[index + 1]))

      wood_height_diff.sort(reverse=True)
      print(wood_height_diff[0])




T = int(sys.stdin.readline())

for _ in range(T):
      N = int(sys.stdin.readline())
      wood_height_list = list(map(int, sys.stdin.readline().split()))
      wood_height_list.sort()
      Solution(N, wood_height_list)

# 리스트 홀수냐 아니냐에 따라서 인덱스 . 슬라이싱하면된다.

# input() 보다 sys.stdin을 선호함 << 더 빠름

 

#순방향 정렬 > 정방향 홀수 리스트에 담고 > 역방향 (짝이냐 , 홀이냐 따라 분기 나눠줘야함) 남은 친구들을 리스트에 담으면 최적의 난이도 구할 수 있음