forked from Ayu-hack/Hacktoberfest2024-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pattern program.java
109 lines (91 loc) · 3.29 KB
/
pattern program.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
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
public class pattern{
public static void main(String []args){
int matrix[][]=new int[5][5];
int i,j,k,l;
int direction=1;
for(i=0;i<5;i++){
for(j=0;j<5;j++){
matrix[i][j]=0;
}
}
for(i=1,j=0,k=0;i<=16;i++){
matrix[j][k]=i;
switch(direction){
case 1:if(k+1<5){
if(matrix[j][k+1]==0){
k++;
continue;
}
else{
j++;
direction=2;
continue;
}
}
else{
j++;
direction=2;
continue;
}
case 2:if(j+1<5){
if(matrix[j+1][k]==0){
j++;
continue;
}
else{
direction=3;
k--;
continue;
}
}
else{
direction=3;
k--;
continue;
}
case 3:if(k-1>=0){
if(matrix[j][k-1]==0){
k--;
continue;
}
else{
direction=4;
j--;
continue;
}
}
else{
direction=4;
j--;
continue;
}
case 4:if(j-1>=0){
if(matrix[j-1][k]==0){
j--;
continue;
}
else{
k++;
direction=1;
continue;
}
}
else{
k++;
direction=1;
continue;
}
}
}
for(i=0;i<5;i++){
for(j=0;j<5;j++){
if(matrix[i][j]==0){
System.out.print("\t");
}
else{
System.out.print(matrix[i][j]+"\t");
}
}
System.out.println("");
}
}