leetcode刷题笔记(Golang)--221. Maximal Square

221. Maximal Square

Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.

Example:

Input:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Output: 4
解题

func maximalSquare(matrix [][]byte) int {
    if len(matrix)==0 || len(matrix[0])==0{
        return 0
    }
    res := 0
	m, n := len(matrix), len(matrix[0])
	dp := make([][]int, m)
	for i := 0; i < m; i++ {
		dp[i] = make([]int, n)
	}
	for i := 0; i < m; i++ {
		for j := 0; j < n; j++ {
            dp[i][j] = int(matrix[i][j] - '0')
			if dp[i][j] == 0 {
				continue
			}
			if i == 0 || j == 0 {
			} else {
				dp[i][j] = int(math.Min(math.Min(float64(dp[i-1][j]), float64(dp[i][j-1])), float64(dp[i-1][j-1]))) + 1
			}
            res = int(math.Max(float64(dp[i][j]*dp[i][j]), float64(res)))
		}
	}
	return res   
}