Open nagato1208 opened 5 years ago
https://nagato1208.github.io/2019/09/08/leetcode-1183-Maximum-Number-of-Ones/#more
描述(搬运)Consider a matrix M with dimensions width height, such that every cell has value 0 or 1, and any square sub-matrix of M of size sideLength sideLength has at most maxOnes ones. Return the max
https://nagato1208.github.io/2019/09/08/leetcode-1183-Maximum-Number-of-Ones/#more
描述(搬运)Consider a matrix M with dimensions width height, such that every cell has value 0 or 1, and any square sub-matrix of M of size sideLength sideLength has at most maxOnes ones. Return the max