在一个值为1和0的矩阵中寻找值为1的最大平方子矩阵

def findMaxSquareMatrix(matrix):
    if not matrix:
        return 0
    
    rows = len(matrix)
    cols = len(matrix[0])
    dp = [[0] * cols for _ in range(rows)]
    maxLen = 0
    maxRow = 0
    maxCol = 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]
                    maxRow = i
                    maxCol = j
    
    return (maxRow - maxLen + 1, maxCol - maxLen + 1), (maxRow, maxCol)