Maximal Square算法详解
来源:互联网 发布:英语在线造句软件 编辑:程序博客网 时间:2024/06/05 11:36
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing all 1’s and return its area.
For example, given the following matrix:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Return 4.
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
题意:给定二维矩阵,包含’0’和’1’,求最大的方阵且方阵内的元素全为’1’,返回’1’的个数
题意:DP题,定义辅助空间w[rows][cols],表示左上角方向的方阵的最大宽度则if matrix[i][j]=’0’ w[i][j]=0 else w[i][j]=1+min(w[i-1][j],w[i][j-1],w[i-1][j-1]);
int maximalSquare(vector<vector<char>>& matrix) { int rows = matrix.size(); if (rows == 0)return 0; int cols = matrix[0].size(); vector<vector<int>> flag(rows, vector<int>(cols, 0)); int maxw = 0; for (int i = 0; i <rows; i++) { for (int j = 0; j<cols; j++) { if (matrix[i][j] == '0') { flag[i][j] = 0; } else { flag[i][j] = 1; if (i != 0 && j != 0) { flag[i][j] += min(min(flag[i - 1][j], flag[i][j - 1]), flag[i - 1][j - 1]); } } maxw = max(flag[i][j], maxw); } } return maxw*maxw; }
0 0
- Maximal Square算法详解
- 算法练习:Maximal Square
- 算法题 lintcode 434 Maximal Square
- 经典算法题之Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- Maximal Square
- JavaSE笔记之<继承深入理解>
- 关于网络性能调优
- mac linux上安装python,opencv等的记录
- 调试LATTICE 的SGMII的调试。
- iOS 周刊 第一期
- Maximal Square算法详解
- js 变量 赋予默认值
- 黑马程序员--代码块
- spring web 业务系统单测使用Jmockit 进行夸层mock 也可以static 方法mock
- leetcode-116-Populating Next Right Pointers in Each Node
- iOS周刊第二期
- OpenTLD再续 - 猪肚
- C++ STL中哈希表 hash_map从头到尾详细介绍
- 递归版更相减损术