[10일차][프로그래머스][161990]바탕화면 정리

def solution(wallpaper):
    wallpaper_max_x = len(wallpaper[0])
    wallpaper_max_y = len(wallpaper)
    file_path_y = []
    file_path_x = []

    for wallpaper_y, data in enumerate(wallpaper):
        for wallpaper_x, val in enumerate(data):
            if val == '#':
                file_path_y.append(wallpaper_y + 1)
                file_path_x.append(wallpaper_x + 1)


    file_path_y_max, file_path_y_min = max(file_path_y), min(file_path_y)
    file_path_x_max, file_path_x_min = max(file_path_x), min(file_path_x)
    answer = [file_path_y_min -1, file_path_x_min -1, file_path_y_max, file_path_x_max ]

    return answer