FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java-Programs/SpiralMatrix.java at master · Scarlet-Coder/Java-Programs · GitHub
Scarlet-Coder
/
Java-Programs
Public
forked from
codec-akash/DSA-PS-Java-Programs
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java-Programs
/
SpiralMatrix.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
68 lines (60 loc) · 1.47 KB
Breadcrumbs
Java-Programs
/
SpiralMatrix.java
Copy path
File metadata and controls
68 lines (60 loc) · 1.47 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*Spirally traversing a matrix
Traversing an array is an elementary operation on an array, in which each element will be processed
for some operation. Printing elements is one example operation.
So, complete the below function, which given a two dimensional array, print the array
in spiral form rotating clockwise.
Input Format
Each test-case will begin with two number m and n where m = no. of rows and
n = no. of columns. m rows will follow with n integers in each row separated
by a space. Constraint : 1<=m<=50 and 1<=n<=50.
Output Format
For each test case, print the elements of 2-d array in spiral form starting
from index (0,0) or upper-left corner in clockwise direction.*/
import
java
.
util
.*;
public
class
SpiralMatrix
{
public
static
void
main
(
String
[]
args
)
{
Scanner
sc
=
new
Scanner
(
System
.
in
);
int
r
=
sc
.
nextInt
();
int
c
=
sc
.
nextInt
();
int
arr
[][]=
new
int
[
r
][
c
];
for
(
int
i
=
0
;
i
<
r
;
i
++)
{
for
(
int
j
=
0
;
j
<
c
;
j
++)
{
arr
[
i
][
j
]=
sc
.
nextInt
();
}
}
int
r1
=
0
,
c1
=
0
;
while
(
r1
<
r
&&
c1
<
c
)
{
for
(
int
i
=
c1
;
i
<
c
;
i
++)
{
System
.
out
.
println
(
arr
[
r1
][
i
]);
}
r1
++;
for
(
int
i
=
r1
;
i
<
r
;
i
++)
{
System
.
out
.
println
(
arr
[
i
][
c
-
1
]);
}
c
--;
if
(
r1
<
r
)
{
for
(
int
i
=
c
-
1
;
i
>=
c1
;
i
--)
{
System
.
out
.
println
(
arr
[
r
-
1
][
i
]);
}
r
--;
}
if
(
c1
<
c
)
{
for
(
int
i
=
r
-
1
;
i
>=
r1
;
i
--)
{
System
.
out
.
println
(
arr
[
i
][
c1
]);
}
c1
++;
}
}
}
}
Back
|
FazBrowse Home
|
New Git URL