def solution(arr):
answer = []
row = len(arr)
col = len(arr[0])
if row > col:
for i in arr:
answer.append(i + [0] * (row - col))
elif row < col:
for _ in range(col - row):
arr.append([0] * col)
answer = arr
else:
answer = arr
return answer
def solution(arr):
n=len(arr)
m=len(arr[0])
if n>m:
for i in range(n):
for j in range(n-m):
arr[i].append(0)
else:
for i in range(m-n):
arr.append([0]*m)
return arr
2차원 배열에 익숙해질 필요가 당연히 있는 법!