level21 게임 맵 최단거리 문제풀이 효율성 실패 import copy def remove_values_from_list(the_list, val): return [value for value in the_list if value != val] def move(my_point, maps, y_len, x_len, count): count += 1 time = 0 counts= [] maps[my_point[0]][my_point[1]] = 0 new_maps = copy.deepcopy(maps) if my_point[0] == y_len-1 and my_point[1] == x_len-1: return count if(my_point[0] != 0 and maps[my_point[0]-1][my_point[1]] != 0): ti.. 2021. 6. 1. 이전 1 다음