-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMatrixSqrPrac.java
74 lines (59 loc) · 1.52 KB
/
MatrixSqrPrac.java
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
import java.util.Scanner;
public class MatrixSqrPrac {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String output;
int ip1_rows = 0;
int ip1_cols = 0;
// ip1_rows = Integer.parseInt(in.nextLine().trim());
//ip1_cols = Integer.parseInt(in.nextLine().trim());
int[][] ip1 = {{1,1,1,1,1},{1,1,1,1,1},{1,1,1,1,1},{1,1,1,1,1}};
output = largestsquarehouse(ip1);
System.out.println(String.valueOf(output));
}
private static String largestsquarehouse(int[][] ip1) {
int[][] arr=new int[ip1.length][ip1[0].length];
int max=Integer.MAX_VALUE;
for(int i=0;i<ip1.length;i++)
{
arr[i][0]=ip1[i][0];
if(arr[i][0]==0)
max=1;
}
for(int j=0;j<ip1[0].length;j++){
arr[0][j]=ip1[0][j];
if(arr[0][j]==0)
max=1;
}
for(int i=1;i<ip1.length;i++)
{
for(int j=1;j<ip1[i].length;j++)
{
if(ip1[i][j]==1)
continue;
int t=1+min(arr[i-1][j],arr[i-1][j-1],arr[i][j-1]);
arr[i][j]=t;
if(arr[i][j]>max)
max=arr[i][j];
}
}
max=max+1;
String f_str=max+"$"+max;
PrintMatrix(arr);
return f_str;
}
private static void PrintMatrix(int[][] arr) {
for(int i=0;i<arr.length;i++)
{
for(int j=0;j<arr[i].length;j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
private static int min(int a, int b, int c) {
int m=Math.min(a,b);
return Math.min(m, c);
}
}