LeetCodePractice/SquareSubMatrix.java at main · BharatBhagyajyoti/LeetCodePractice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

package leetcode;

/*
------------------------------Count Submatrix with all ONEs--------------------------------

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

package leetcode;

/*
------------------------------Count Submatrix with all ONEs--------------------------------

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


 */


public class SquareSubMatrix {
    public static void main(String[] args)
    {
        int[][] matrix = {
                {0, 1, 1, 1},
                {1, 1, 1, 1},
                {0, 1, 1, 1}
        };

        int totalSquareMatrix=0;
        for (int i = 0; i < matrix.length; i++)
        {
            for (int j = 0; j < matrix[i].length; j++)
            {
                System.out.print(matrix[i][j] + " ");
            }
            System.out.println();
        }

        int cONE=0;//1X1
        for (int i = 0; i < matrix.length; i++)
        {
            for (int j = 0; j < matrix[i].length; j++)
            {
                if (matrix[i][j]==1)
                    cONE++;
            }
        }
        System.out.println("1X1="+cONE);

        int cTWO=0;
        for (int i = 0; i < matrix.length - 1; i++)
        {
            for (int j = 0; j < matrix[i].length - 1; j++)
            {
                if (matrix[i][j] == 1 && matrix[i][j + 1] == 1)
                {
                    if (matrix[i + 1][j] == 1 && matrix[i + 1][j + 1] == 1)
                        cTWO++;

                }
            }
        }

        System.out.println("2X2="+cTWO);

        int cTHREE=0;//3X3
        for (int i = 0; i < matrix.length - 2; i++)
        {
            for (int j = 0; j < matrix[i].length - 2; j++)
            {
                if (matrix[i][j] == 1 && matrix[i][j + 1] == 1 && matrix[i][j + 2] == 1)
                {
                    if (matrix[i + 1][j] == 1 && matrix[i + 1][j + 1] == 1 && matrix[i + 1][j + 2] == 1)
                    {
                        if (matrix[i + 2][j] == 1 && matrix[i + 2][j + 1] == 1 && matrix[i + 2][j + 2] == 1)
                            cTHREE++;
                    }
                }
            }
        }
        System.out.println("3X3="+cTHREE);

        totalSquareMatrix=cONE+cTWO+cTHREE;
        System.out.println("Total Square submatrix="+totalSquareMatrix);

    }
}