寻找最大的正方子矩阵

def findLargestSquareMatrix(matrix):
    rows = len(matrix)
    cols = len(matrix[0])
    dp = [[0] * cols for _ in range(rows)]
    maxLen = 0
    r, c = 0, 0

    for i in range(rows):
        for j in range(cols):
            if matrix[i][j] == 1:
                if i == 0 or j == 0:
                    dp[i][j] = 1
                else:
                    dp[i][j] = min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]) + 1

                if dp[i][j] > maxLen:
                    maxLen = dp[i][j]
                    r, c = i, j

    return (r - maxLen + 1, c - maxLen + 1, maxLen)

# 示例输入矩阵
matrix = [
    [1, 0, 1, 0, 0],
    [1, 0, 1, 1, 1],
    [1, 1, 1, 1, 1],
    [1, 0, 0, 1, 0]
]

result = findLargestSquareMatrix(matrix)
print("最大正方子矩阵的左上角位置：({}, {})".format(result[0], result[1]))
print("最大正方子矩阵的边长：{}".format(result[2]))