Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1277 - Count Square Submatrices with All Ones\.

    Medium

    Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.

    Example 1:

    Input: matrix = [ 0,1,1,1, 1,1,1,1, 0,1,1,1 ]

    Output: 15

    Explanation:

    There are 10 squares of side 1.

    There are 4 squares of side 2.

    There is 1 square of side 3.

    Total number of squares = 10 + 4 + 1 = 15.

    Example 2:

    Input: matrix = [ 1,0,1, 1,1,0, 1,1,0 ]

    Output: 7

    Explanation:

    There are 6 squares of side 1.

    There is 1 square of side 2.

    Total number of squares = 6 + 1 = 7.

    Constraints:

    • 1 <= arr.length <= 300

    • 1 <= arr[0].length <= 300

    • 0 <= arr[i][j] <= 1

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Integer countSquares(Array<IntArray> matrix)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait