{"push_id":752645676,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"982035fa1d223805b1fd3e9bc7d845f5e6617941","before":"099aef94b56db78a8fc2af810a50afa0b44ba962","commits":[{"sha":"857eef863d62245135a6ee8e833a50202840fcbd","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"v2 - recursive\n\n1. 如果左右子树的节点数相同，则等于(2^h) - 1；否则等于左子树节点加右子树节点再加1.","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/857eef863d62245135a6ee8e833a50202840fcbd"},{"sha":"4329f0a64303c4ce9ce684ac554b165a3319dd7a","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"v2 - dynamic programming\n\n1. 设置一个m*n的二维矩阵dp。dp[i][j]表示包含有matrix[i][j]的最大正方形边长。递推关系式为dp[i][j] =\n(matrix == 1) ? min(min(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1]) + 1 : 0.","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/4329f0a64303c4ce9ce684ac554b165a3319dd7a"},{"sha":"415cc0dbaa93c2ecae5bd9a2730c7380aca3f4aa","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"v2.1 dynamic programming & space O(n)\n\n1. 空间复杂度缩小到O(n)，只用两个一维数组维护即可。一个用来保存前一列，一个用来保存当前列的包含该点的最大正方形边长。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/415cc0dbaa93c2ecae5bd9a2730c7380aca3f4aa"},{"sha":"982035fa1d223805b1fd3e9bc7d845f5e6617941","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"v2 - hash table","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/982035fa1d223805b1fd3e9bc7d845f5e6617941"}]}