코딩테스트/Python
프로그래머스 스쿨 - 바탕화면 정리(Python)(복습)
NOCKNOCK
2023. 10. 5. 10:51
answer = [0, 0, 0, 0]
def solution(wallpaper):
x, y = [], []
for i in range(len(wallpaper)):
for j in range(len(wallpaper[i])):
if wallpaper[i][j] == "#":
y.append(i)
x.append(j)
lux = min(y)
luy = min(x)
rdx = max(y) + 1
rdy = max(x) + 1
answer = [lux, luy, rdx, rdy]
return answer