Java 2D Arrays Programming Basics
Uploaded by
Fatima AhmedJava 2D Arrays Programming Basics
Uploaded by
Fatima AhmedJava - Introduction to Programming
Lecture 11
2D Arrays In Java
It is similar to 2D matrices that we studied in 11th and 12th class.
a. Creating a 2D Array - withnewkeyword
int
[][] marks =
new int
[
3
][
3
]
;
b. Taking a matrix as an input and printing its elements.
import
java
.
u
til
.*;
public
class
TwoDArrays
{
public
static
void
main
(
S
tring
args
[]) {
Scanner
sc
=
new
Scanner
(
System
.
in
);
int
rows
=
sc
.
n
extInt
();
int
cols
=
sc
.
n
extInt
();
int
[][]
numbers
=
new
int
[
r
ows
][
cols
];
//input
//rows
for
(
i
nt
i
=
0
;
i
<
r
ows
;
i
++) {
//columns
for
(
i
nt
j
=
0
;
j
<
c
ols
;
j
++) {
numbers
[
i
][
j
]
=
sc
.
nextInt
();
}
}
for
(
i
nt
i
=
0
;
i
<
r
ows
;
i
++) {
for
(
i
nt
j
=
0
;
j
<
c
ols
;
j
++) {
System
.
out
.
print
(
numbers
[
i
]
[
j
]
+
"
"
);
}
System
.
out
.
p
rintln
();
}
}
Apna College
}
c. Searching for an element x in a matrix.
import
java
.
u
til
.*;
public
class
TwoDArrays
{
public
static
void
main
(
S
tring
args
[]) {
Scanner
sc
=
new
Scanner
(
System
.
in
);
int
rows
=
sc
.
n
extInt
();
int
cols
=
sc
.
n
extInt
();
int
[][]
numbers
=
new
int
[
r
ows
][
cols
];
//input
//rows
for
(
i
nt
i
=
0
;
i
<
r
ows
;
i
++) {
//columns
for
(
i
nt
j
=
0
;
j
<
c
ols
;
j
++) {
numbers
[
i
][
j
] =
sc
.
nextInt
();
}
}
int
x
=
sc
.
nextInt
();
for
(
i
nt
i
=
0
;
i
<
r
ows
;
i
++) {
for
(
i
nt
j
=
0
;
j
<
c
ols
;
j
++) {
//compare with x
if
(
numbers
[
i
][
j
] ==
x
)
{
System
.
o
ut
.
println
(
"x found at
location ("
+
i
+
", "
+
j
+
")"
);
}
}
}
}
}
Apna College
Homework Problems
1. P
rint the spiral order matrix as output for a given matrix of numbers.
[Difficult for Beginners]
APPROACH:
Algorithm: (We are given a 2D matrix of n X m ).
1. We will need 4 variables:
a. row_start - initialized with 0.
b. row_end - initialized with n-1.
c. column_start - initialized with 0.
d. column_end - initialized with m-1.
2. First of all, we will traverse in the row row_start from column_start
Apna College
to column_end and we will increase the row_start with 1 as we have
traversed the starting row.
3. Then we will traverse in the column column_end from row_start to
row_end and decrease the column_end by 1.
4. Then we will traverse in the row row_end from column_end to
column_start and decrease the row_end by 1.
5. Then we will traverse in the column column_start from row_end to
row_start and increase the column_start by 1.
6. We will do the above steps from 2 to 5 until row_start <= row_end
and column_start <= column_end.
import
java
.
u
til
.*;
public
class
Arrays
{
public
static
void
main
(
S
tring
args
[]) {
Scanner
sc
=
new
Scanner
(
S
ystem
.
in
);
int
n
=
sc
.
n
extInt
();
int
m
=
sc
.
n
extInt
();
int
matrix
[][] =
new
int
[
n
][
m
];
for
(
i
nt
i
=
0
;
i
<
n
;
i
++) {
for
(
i
nt
j
=
0
;
j
<
m
;
j++) {
matrix
[
i
]
[
j
]
=
sc
.
nextInt
();
}
}
System
.
out
.
p
rintln
(
"
The Spiral Order Matrix
is : "
);
int
rowStart
=
0
;
Apna College
int
rowEnd
=
n
-
1
;
int
colStart
=
0
;
int
colEnd
=
m
-
1
;
//To print spiral order matrix
while
(
rowStart
<=
rowEnd
&&
colStart
<=
colEnd
)
{
//1
for
(
int
col
=
c
olStart
;
col
<=
colEnd
;
col
++)
{
System
.
out
.
p
rint
(
matrix
[
rowStart
][
col
]
+
" "
);
}
rowStart
++;
//2
for
(
int
row
=
r
owStart
;
row
<=
rowEnd
;
row
++)
{
System
.
out
.
p
rint
(
matrix
[
row
][
colEnd
]
+
" "
);
}
colEnd
--;
//3
for
(
int
col
=
c
olEnd
;
col
>=
colStart
;
col
--)
{
System
.
out
.
p
rint
(
matrix
[
rowEnd
][
col
]
+
" "
);
}
rowEnd
--;
//4
for
(
int
row
=
r
owEnd
;
row
>=
rowStart
;
row
--)
{
Apna College
System
.
out
.
p
rint
(
matrix
[
row
][
colStart
] +
" "
);
}
colStart
++;
System
.
o
ut
.
p
rintln
();
}
}
}
2. For a given matrix of N x M, print its transpose.
import
java
.
u
til
.*;
public
class
Arrays
{
public
static
void
main
(
S
tring
args
[]) {
Scanner
sc
=
new
Scanner
(
S
ystem
.
in
);
int
n
=
sc
.
n
extInt
();
int
m
=
sc
.
n
extInt
();
int
matrix
[][] =
new
int
[
n
][
m
];
for
(
i
nt
i
=
0
;
i
<
n
;
i
++) {
for
(
i
nt
j
=
0
;
j
<
m
;
j++) {
matrix
[
i
]
[
j
]
=
sc
.
nextInt
();
}
}
Apna College
System
.
out
.
p
rintln
(
"
The transpose is : "
);
//To print transpose
for
(
i
nt
j
=
0
;
j
<
m
;j
++) {
for
(
int
i=
0
;
i<
n
;
i
++) {
System
.
out
.
p
rint
(
matrix
[
i
]
[
j
]
+
" "
);
}
System
.
o
ut
.
p
rintln
();
}
}
}
Apna College
You might also like
- Understanding Arrays in Java ProgrammingNo ratings yetUnderstanding Arrays in Java Programming12 pages
- Understanding Multidimensional Arrays in JavaNo ratings yetUnderstanding Multidimensional Arrays in Java25 pages
- Java Matrix Operations and Word ManipulationNo ratings yetJava Matrix Operations and Word Manipulation13 pages
- Java Program for Prime Numbers and Matrix Multiplication50% (2)Java Program for Prime Numbers and Matrix Multiplication6 pages
- University of Central Punjab: Faculty of Information TechnologyNo ratings yetUniversity of Central Punjab: Faculty of Information Technology3 pages
- University of Central Punjab: Faculty of Information TechnologyNo ratings yetUniversity of Central Punjab: Faculty of Information Technology2 pages
- University of Central Punjab: Faculty of Information TechnologyNo ratings yetUniversity of Central Punjab: Faculty of Information Technology2 pages
- Data Structure Assignment: Lists ExplainedNo ratings yetData Structure Assignment: Lists Explained10 pages
- Understanding Scatter Plots and CorrelationNo ratings yetUnderstanding Scatter Plots and Correlation27 pages
- Probability and Statistics Course OverviewNo ratings yetProbability and Statistics Course Overview36 pages
- Understanding Sample and Population MeansNo ratings yetUnderstanding Sample and Population Means29 pages
- Comprehensive Guide to Logical ReasoningNo ratings yetComprehensive Guide to Logical Reasoning11 pages
- Understanding Matrix Types and PropertiesNo ratings yetUnderstanding Matrix Types and Properties71 pages
- Linear Regression - A Mathematical IntroductionNo ratings yetLinear Regression - A Mathematical Introduction344 pages
- Matrix Determinants and Their ApplicationsNo ratings yetMatrix Determinants and Their Applications23 pages
- Image Processing: Spatial Filtering TechniquesNo ratings yetImage Processing: Spatial Filtering Techniques46 pages
- Automatic Perspective Correction MethodNo ratings yetAutomatic Perspective Correction Method12 pages
- Efficient Compression of Blendshape ModelsNo ratings yetEfficient Compression of Blendshape Models10 pages
- C Programming Lab: Algorithms & FlowchartsNo ratings yetC Programming Lab: Algorithms & Flowcharts41 pages
- Pipelining and Vector Processing OverviewNo ratings yetPipelining and Vector Processing Overview48 pages
- Master of Library Science Program OverviewNo ratings yetMaster of Library Science Program Overview33 pages
- Quantitative Techniques for Decision-MakingNo ratings yetQuantitative Techniques for Decision-Making27 pages
- B.Com (Hons) Course Structure & SyllabusNo ratings yetB.Com (Hons) Course Structure & Syllabus57 pages
- Engineering Knowledge Test Ebook Electrical and Electronics71% (17)Engineering Knowledge Test Ebook Electrical and Electronics423 pages