{"push_id":953239622,"size":7,"distinct_size":7,"ref":"refs/heads/master","head":"e6933803bb5ee6cb7472706e29dc62ca89976678","before":"3a6003df77d83632bfa5a99cc64e4edb7179e0b6","commits":[{"sha":"9d23a06b71edfa9b903a4fcb3744faa3e026d55d","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v1.2 - dynamic programming\n\n1. 动态规划；\n2. 设dp[i][j]为以matrix[i][j]为右下角的正方形边长，递推关系式为dp[i][j] = matrix[i][j] == 1\n? min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]) + 1 : 0\n3. 时间复杂度为O(n^2)，空间复杂度为O(n^2)。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/9d23a06b71edfa9b903a4fcb3744faa3e026d55d"},{"sha":"be6246afdbf1f1ecfdfa67c08a801fb7bc0fc797","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v2.1 - recursive\n\n1. 递归；\n2. 当一个节点的左子树中最左孩子高度等于右子树中最右孩子高度时，为满二叉树，节点数为2^k - 1；否则为左子树节点数 + 右子树节点数 +\n1.","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/be6246afdbf1f1ecfdfa67c08a801fb7bc0fc797"},{"sha":"5e747d47c40b0fc3d4b255a0085f6ac5b90a2998","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v2.1 - 相交和相离\n\n1. 分成相离和相交两种情形；\n2. 相离时，总面积 = 两矩形面积之和\n3. 相交时，总面积 = 两矩形面积之和 -\n相交矩形面积。其中相交矩形的左下端点为两矩形的左下端点的横纵坐标的较小值，右上端点为两矩形的右上端点的横纵坐标的较大值。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/5e747d47c40b0fc3d4b255a0085f6ac5b90a2998"},{"sha":"5d1bb544144602e78eed7c543c07b48b627f7608","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v2.1 - sign stack\n\n1.\n符号栈，对于每一个数字或者括号前都有一个符号，用栈来保存每一个符号，初始化时栈中有两个1，即两个正号，保证第一个元素弹出后，还有符号可以与后续数字或符号进行运算。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/5d1bb544144602e78eed7c543c07b48b627f7608"},{"sha":"55c3c9ecbf41983a32c4eb17776fd1b5904ee698","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v1.2 - two queues\n\n1. 用两个队列来模拟栈。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/55c3c9ecbf41983a32c4eb17776fd1b5904ee698"},{"sha":"ce0c9e57aff4f4516abfb128aabb85e04c115151","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v1.0 - stack\n\n1. 栈；\n2. 用栈来模拟前序遍历的左子树过程，当前元素小于栈顶元素时，说明还在左子树中，则入栈；\n3. 否则弹栈直到栈为空或者当前元素小于栈顶元素，并更新下界，在后续的遍历过程中（右子树）不可能出现比下界更小的节点，直到遍历完序列。\n4. 时间复杂度为O(n)，空间复杂度为O(n)。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/ce0c9e57aff4f4516abfb128aabb85e04c115151"},{"sha":"e6933803bb5ee6cb7472706e29dc62ca89976678","author":{"email":"c8385c009cb0e1084947e717876bea3baa384391@gmail.com","name":"Zhao Wei"},"message":"v2.0 - space O(1)\n\n1. 在v1的基础上，复用输入数组的空间，用它来模拟栈，将空间复杂度降为O(1)。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/e6933803bb5ee6cb7472706e29dc62ca89976678"}]}