Given a n*m matrix of 1 and 0, find 1) the max square submatrix of all 1s, 2) the max rectangle matrix of all 1s.
1) is easy, see here. The code here needs a little correction, see here.
2) is hard, see here.
Subscribe to:
Post Comments (Atom)
Blog Archive
-
▼
2010
(67)
-
▼
April
(14)
- Find median
- Find Median of Two Sorted Arrays
- Online Algorithm Resources
- Max submatrix problem
- Check Equality of Two Number Sets
- Largest rectangle in histogram problem
- IR Evaluation
- Garbage collector implementation
- Find prime numbers
- Newton Ralphson's method to calculate square root
- The Frobenius Number
- Search in a circular sorted array
- The Maximal Rectangle Problem
- Young Tableau
-
▼
April
(14)
1 comment:
sir, can you please provide me with an implementation of the same in java
Post a Comment