[백준] 1051번_숫자정사각형

문제 링크 : https://www.acmicpc.net/problem/1051

1051번: 숫자 정사각형

size = 0
n,m = map(int,input().split())
rec = [list(input()) for _ in range(n)]
for i in range(n-1):
    for j in range(m-1):
        num = rec[i][j]
        for k in range(i+1,n):
            if rec[k][j] == num:
                length = k-i
                try:
                    if (rec[i][j+length] == num) and (rec[i+length][j+length]==num):
                        size = max(size,length)
                except IndexError:
                    continue
                    
print((size+1)**2)

try-except 문을 피하고자 

다시

size = 1
n,m = map(int,input().split())
rec = [list(input()) for _ in range(n)]
for i in range(n-1):
    for j in range(m-1):
        num = rec[i][j]
        for k in range(i+1,n):
            if rec[k][j] == num:
                length = k-i
                if (i+length<n) and (j+length<m):
                    if (rec[i][j+length] == num) and (rec[i+length][j+length]==num):
                        size = max(size,length+1)
                
print(size**2)

이렇게 풀었다.

+ 쓰고나니 if 절에서 (i+length<n) 이것은 확인 안해줘도 되었네ㅎ