Leetcode 221. 最大正方形（DAY 45） ---- 动态规划学习期（懒狗觉醒 鸽子鸽了好几天）

---

原题题目

---

---

代码实现（首刷自解）

---

int maximalSquare(char** matrix, int matrixSize, int* matrixColSize){
    int dp[301][301],i,j,max = 0;
    memset(dp,0,sizeof(dp));
    for(i=0;i<matrixSize;i++)
    {
        for(j=0;j<matrixColSize[0];j++)
        {
            if(matrix[i][j] == '1')
                dp[i][j] = 1;
        }
    }
    
    for(i=0;i<matrixSize;i++)
    {
        for(j=0;j<matrixColSize[i];j++)
        {
            if(i && j)
            {
                if(dp[i][j] && dp[i-1][j-1] && dp[i-1][j] && dp[i][j-1])
                    dp[i][j] = fmin(dp[i-1][j-1],fmin(dp[i-1][j],dp[i][j-1])) + 1;
            }
            if(dp[i][j] > max)
                max = dp[i][j];
        }
    }
    return pow(max,2);
}

---

代码实现（二刷DAY 94 C++自解）

---

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        int xsize = matrix.size(),ysize = matrix[0].size(),ret = -1;
        vector<vector<int>> dp(xsize,vector<int>(ysize,0));
        for(int i=0;i<xsize;++i)
        {
            for(int j=0;j<ysize;++j)
            {
                dp[i][j] = matrix[i][j] - '0';
                if(i && j && dp[i][j])  dp[i][j] = min(dp[i-1][j],min(dp[i-1][j-1],dp[i][j-1]))+1;
                ret = max(dp[i][j],ret);
            }
        }
        return pow(ret,2);
    }
};

---

代码实现（三刷自解 DAY 290 C++）

---

class Solution {
 public:
  int maximalSquare(vector<vector<char>>& matrix) {
    vector<vector<int>> dp(matrix.size() + 1, vector<int>(matrix[0].size() + 1, 0));
    int ret = 0;

    for (int i = 1; i <= matrix.size(); ++i) {
      for (int j = 1; j <= matrix[0].size(); ++j) {
        if (matrix[i - 1][j - 1] == '0') continue;
        
        int minaround = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;
        dp[i][j] = minaround;
        ret = max(ret, minaround * minaround);
      }
    }
    return ret;
  }
};

---

代码实现（四刷自解 DAY 8 Golang）

---

func min(x, y int) int {
  if x <= y {
    return x
  } else {
    return y
  }
}

func max(x, y int) int {
  if x >= y {
    return x
  } else {
    return y
  }
}

func maximalSquare(matrix [][]byte) int {
  ret := 0
  dp := make([][]int, len(matrix) + 1)
  for i := 0; i <= len(matrix); i++ {
    dp[i] = make([]int, len(matrix[0]) + 1)
  }

  for i := 1; i <= len(matrix); i++ {
    for j := 1; j <= len(matrix[0]); j++ {
      if matrix[i - 1][j - 1] == '1' {
        dp[i][j] = 1
        otherdp := min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1]))
        if dp[i][j] == 1 {
          dp[i][j] = max(dp[i][j], otherdp + 1)
          ret = max(ret, dp[i][j])
        }
      }
    }
  }
  return ret * ret
}