[Leetcode] Maximal Square
摘要：
一、枚举所有宽度为举着宽度的子矩阵，从中找出是否具有相应长度的正方形，复杂度为O（n^3）；二、[1]中使用动态规划，decrease the complexity to O(n^2)dp[i][j] mean the maximum square which has right-down corn... 阅读全文
posted @ 2015-08-01 14:30 F_G 阅读(128) 评论(0) 推荐(0) 编辑