starting out with java: early objects third edition
DESCRIPTION
Chapter 7: Arrays and the ArrayList Class. Starting Out with Java: Early Objects Third Edition by Tony Gaddis as modified for CSCI 1250/1260. Chapter Topics. Chapter 7 discusses the following main topics: Introduction to Arrays Processing Array Contents - PowerPoint PPT PresentationTRANSCRIPT
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Starting Out with Java: Early Objects Third Edition
by Tony Gaddis as modified for CSCI 1250/1260
Chapter 7:Arrays and the ArrayList Class
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-2
Chapter Topics
Chapter 7 discusses the following main topics: Introduction to Arrays Processing Array Contents Passing Arrays as Arguments to Methods Some Useful Array Algorithms and Operations Returning Arrays from Methods String Arrays Arrays of Objects
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-3
Chapter Topics
Chapter 7 discusses the following main topics: The Sequential Search Algorithm Two-Dimensional Arrays Arrays with Three or More Dimensions The Selection Sort and the Binary Search Command-Line Arguments The ArrayList Class
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-4
Introduction to Arrays
• Primitive variables are designed to hold only one value at a time.• Arrays allow us to create a collection of values of a single type. • This collection is indexed so that we can access any item in the
array using its index. The index of the first item is 0.• An array can store any type of data but only one type of data at a
time per array – in other words, all items in the collection must be of the same type (all integers, all doubles, all Strings, etc.).
• An array can be thought of as a list or table of data elements.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-5
Creating Arrays• An array is an object so it needs an object reference. Square
brackets designate an array.// Declare a reference to an array that will hold integers int[] numbers;
• The next step creates the array and assigns its address to the numbers reference variable// Create a new array that will hold 6 integersnumbers = new int[6];
• The array may be viewed as either a row or as a column of values
Integer array element values are initialized to 0.Array indexes always start at 0.
The last subscript is always the one less than the size.
0index 0
0index 1
0index 2
0index 3
0index 4
0index 5
Index 0 0Index 1 0Index 2 0
Index 3 0Index 4 0Index 5 0
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-6
Creating Arrays
• We may declare an array reference and create a new array instance in the same statement.int[] numbers = new int[6];
• Arrays may be of any single type. Some arrays of primitive types are shown here. float[] temperatures = new float[100];char[] letters = new char[41];long[] units = new long[50];double[] sizes = new double[1200];
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-7
Creating Arrays• The array size must be a positive integer• It may be a literal value, a constant, or variable
final int ARRAY_SIZE = 6;int[] numbers = new int[ARRAY_SIZE];
• Using a named constant is preferred because the array size may be used in many places in the code and this way provides for easy changes, if and when they are needed
• Once created, an array size is fixed and cannot be changed
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-8
Accessing the Elements of an Array
• An array is accessed by: the reference name and a subscript or index that identifies which element
in the array to access
numbers[0] = 20; //pronounced "numbers sub zero“
// or “numbers index zero”
numbers[0]
0numbers[1]
0numbers[2]
0numbers[3]
0numbers[4]
0numbers[5]
20 0 0
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-9
Inputting and Outputting Array Elements
• Array elements can be used as any other variables• They are simply accessed by the array name and
a subscript• See example on next slide: ArrayDemo1.java• Array subscripts can be variables (such as for
loop counters)• See example (slide 7-11) : ArrayDemo2.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-10
I/O with Array Elements
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-11
I/O with Array Elements
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-12
Bounds Checking• Array indexes always start at zero and continue
through (array length - 1)int[ ] values = new int[10];
• This array would have indexes 0 through 9• See example (next slide): InvalidSubscript.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-13
Bounds Checking
Exception thrown and program crashes
when index is 3
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-14
Off-by-One Errors• It is very easy to be off-by-one when accessing
arrays// This code has an off-by-one errorint[] numbers = new int[100];for (int i = 1; i <= 100; i++)
numbers[i] = 99;• When i reaches 100, this code would throw an ArrayIndexOutOfBoundsException because there is no position number 100 – the last one is position 99
Here, the equal sign allows the loop to continue to index 100, even though 99 is the
last index in the array
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-15
Array Initialization• When relatively few items need to be initialized, an
initialization list can be used to initialize the arrayint[]days = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
• The numbers in the list are stored in the array in order: days[0] is assigned 31 days[1] is assigned 28 days[2] is assigned 31 days[3] is assigned 30 etc.
• See example (next 2 slides): ArrayInitialization.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-16
Array Initialization
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-17
Example repeated
Added String array of month
names
Obtained both monthName and number of days from the two arrays
using the same index for both
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-18
Array initialization
• In addition to initializing an array as shown on the previous slides, one may assign an existing array object to the new array referenceFor example, if Face is an enumerated type listing all
of the faces in a playing card, the following creates an array of Faces named myFaces and initializes it with all of the possible faces using the values method that is present in all enumerated types
Face[ ] myFaces = Face.values( );
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-19
Alternate Array Declaration• Previously we showed arrays being declared:
int[ ] numbers; However, the brackets can also go here:
int numbers[ ]; These are equivalent but the first style is more common
• Multiple arrays can be declared on the same line with the original notation
int[ ] numbers, codes, scores;• With the alternate notation each variable must have its
own set of bracketsint numbers[ ], codes[ ], scores;
The scores variable in this instance is simply an ordinary int variable
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-20
Processing Array Contents• Processing a data item in an array is done in the
same ways as any other variablegrossPay = hours[3] * payRate;
• Pre and post increment/decrement also works the same:int[] score = {7, 8, 9, 10, 11};++score[2]; // Pre-increment operationscore[4]++; // Post-increment operation
• See example (see next slide): PayArray.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-21
Processing Array Contents
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-22
Processing Array Contents
• Array elements can be used in relational operations:
if(cost[20] < cost[0]){
//statements}
• They can be used in loop conditions:while(value[count] != 0){
//statements}
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-23
The Enhanced for Loop
• Simplified array processing (read only)• Always goes through all elements. Can be thought of as “for
each item in the array, do … ”• General:
for(datatype elementVariableName : arrayName){ statement;}
• Example:int[] numbers = {3, 6, 9};for(int val : numbers){System.out.println("The next value is " + val);
}
Read this as “for each integer, named val, in
the array named numbers” …
This means we can use values in the array with this technique, but we should not change
them
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-24
Array Length
• Arrays are objects and provide a public field named length that is a constant that can be tested, displayed, compared, etc.
double[] temperatures = new double[25];
The length of this array is 25• The length of an array can be obtained via its length constant
int size = temperatures.length;
The variable size will contain 25
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-25
Array Size
• The length constant can be used in a loop to provide automatic bounding
for(int i = 0; i < temperatures.length; i++){ System.out.println("Temperature " + i ": " + temperatures[i]);
}
Index subscripts start at 0 and end at one less than the array length.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-26
Array Size
• You can let the user specify the size of an array (but you should check to make sure the user specifies a reasonable size):
int numTests;int[] tests;Scanner keyboard = new Scanner(System.in);System.out.print("How many tests (1-9)? ");numTests = keyboard.nextInt( );if (numTests > 0 && numTests < 10)
tests = new int[numTests];
• See example (next slide): DisplayTestScores.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-27
Array Size
Should verify that numTests is reasonable
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-28
Reassigning Array References
• An array reference can be assigned to another array of the same type
// Create an array referenced by the numbers variable.
int[] numbers = new int[10];
// Reassign numbers to a new array.numbers = new int[5];
• After the first (10-element) array no longer has a reference to it, it will be garbage collected
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-29
Reassigning Array References
AddressThe numbers variableholds the address of anint array
int[] numbers = new int[10];
numbers
new array to which numbers refers
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-30
Reassigning Array References
AddressThe numbers variableholds the address of anint array.
numbers = new int[5];
This array is marked for garbage collection since it is no longer referenced
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-31
Copying Arrays
• This is not the way to copy an arrayint[] array1 = { 2, 4, 6, 8, 10 };int[] array2 = array1; // This does not copy array1
2
Addressarray1 holds anaddress to the array
Addressarray2 holds anaddress to the array
4 6 8 10
Example:SameArray.java
Shallow copy vs. deep copy; this incorrect approach is called a
shallow copy
Shallow copy simply makes both items refer to same physical array
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-32
Copying Arrays – Deep Copy• You cannot copy an array by merely assigning
one reference variable to another• To copy an array, you must first have two
separate arrays of the same size ( and not just two references to the same array)
• Then you must copy the individual elements of one array to the other, one at a time in a loop
int[] firstArray = {5, 10, 15, 20, 25 };int[] secondArray = new int[5];for (int i = 0; i < firstArray.length; i++) secondArray[i] = firstArray[i];
• This code copies each element of the firstArray to the corresponding element of the secondArray
Called a Deep Copy
Two separate arrays
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-33
Passing Array Elements to a Method
• When a single element of an array is passed to a method it is handled like any other variable
• See example (next slide): PassElements.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-34
Passing a single element of an array
Array element used as a parameter
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-35
Passing Arrays as Arguments
• Arrays are objects• Their references can be passed to methods like
any other object reference variable
5 10 15 20 25
Address
showArray(numbers); 30 35 40
public static void showArray(int[] array){ for (int i = 0; i < array.length; i++) System.out.print(array[i] + " ");}
Example: PassArray.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-36
Comparing Arrays• The == operator determines only whether array references
refer to the same array object• To compare the contents of an array the proper way:
int[] firstArray = { 2, 4, 6, 8, 10 };int[] secondArray = { 2, 4, 6, 8, 10 };// Assume they are equal until we have evidence they are notboolean arraysEqual = true; int i = 0;if (firstArray.length != secondArray.length) arraysEqual = false;
while (arraysEqual && i < firstArray.length){ if (firstArray[i] != secondArray[i]) arraysEqual = false; i++;}
if (arraysEqual) System.out.println("The arrays are equal.");else System.out.println("The arrays are not equal.");
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-37
Array Algorithms
• There are many algorithms for doing common things with arraysFill (or populate) an arrayDisplay arrayFind largest/smallest value in an arrayDetermine whether an array contains a particular
valueSort the data in the array into some order
• Some of these algorithms are given in examples in subsequent slides
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-38
Finding the largest• For small sets of values, we can almost “see”
the answer without giving much thought
• For larger sets of values, we need a mental “algorithm”
• The computer cannot just see the answer - it needs an algorithm– We scan the items one at a time
– The first is the largest we have seen when it is the only one we have seen
– Scan the rest until we find a larger one
– Remember it
– Repeat previous two steps until finished
– What we are remembering at the end is the largest
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-39
Useful Array Operations• Finding the Highest Value
int [] numbers = new int[50];
// Assume the array has now been filled with integersint highest = numbers[0]; // First is largest so far
for (int i = 1; i < numbers.length; i++){
if (numbers[i] > highest)highest = numbers[i];
}
• Finding the Lowest Valueint lowest = numbers[0];
for (int i = 1; i < numbers.length; i++){
if (numbers[i] < lowest)lowest = numbers[i];
}
Starting with the second item – the one in
position 1 – scan the rest, comparing each to the largest seen so far
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-40
Useful Array Operations• Summing Array Elements:
int total = 0; // Initialize accumulator
for (int i = 0; i < units.length; i++) total += units[i];
• Averaging Array Elements:double total = 0; // Initialize accumulatordouble average; // Will hold the averagefor (int i = 0; i < scores.length; i++)total += scores[i];
average = total / scores.length;
• Example (next slides): SalesData.java, Sales.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-41
Example
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-42
Example Continued
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-43
Partially Filled Arrays• Typically, if the amount of data that an array must hold is unknown:
Set the size of the array to the largest number of elements you MIGHT need Use a counting variable to keep track of how much valid data is in the array
(remember the length of the array is the number of values it could hold – not the number it does hold, which could be fewer)…int[] array = new int[100];int count = 0;… System.out.print("Enter a number or -1 to quit: "); number = keyboard.nextInt(); while (number != -1 && count <= 99) { array[count] = number; count++; System.out.print("Enter a number or -1 to quit: "); number = keyboard.nextInt(); }
…
Assume number, and keyboard were previously declared and keyboard references a Scanner object
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-47
Returning an Array Reference
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-48
String Arrays• Arrays are not limited to primitive data• An array of String objects can be created:
String[] names = { "Bill", "Susan", "Steven", "Jean" };
The names variable holds
the address to the array
A String array is an arrayof references to String objects
Address
“Bill”
“Susan”
“Steven”
“Jean”
address
address
address
address
names[1]
names[0]
names[3]
names[2]
Example (next slide):MonthDays.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-49
String Array Example
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-50
String Arrays
• If an initialization list is not provided, the new keyword must be used to create the array:
String[] names = new String[4];
The names variable holdsthe address to the array
Address
null
null
null
null
names[1]
names[0]
names[3]
names[2]
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-51
String Arrays
• When an array is created in this manner, each element of the array must be initialized individually
The names variable holdsthe address to the array
Address
names[0] = "Bill";names[1] = "Susan";names[2] = "Steven";names[3] = "Jean";
“Bill”
“Susan”
“Steven”
“Jean”
names[1]
names[0]
names[3]
names[2]
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-52
Calling String Methods On Array Elements• String objects have several methods, including:
toUpperCase compareTo equals charAt
• Each element of a String array is a String object• Methods of the String class can be used by giving the array name and index as before
System.out.println(names[0].toUpperCase());char letter = names[3].charAt(0);
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-53
The length Field & The length Method• Arrays have a final field (attribute) named length• String objects have a method named length• To display the length of each string held in a String
array:for (int i = 0; i < names.length; i++) System.out.println(names[i].length());
• An array’s length is an attribute (field) You do not use a set of parentheses after its name
• A String’s length is a method You do place the parentheses after the name of the String
class’s length method
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-54
Arrays of Objects
• Strings are objects. Arrays can contain objects – Strings or any other types of objectsInventoryItem[] inventory = new InventoryItem[5];
The inventory variable holds the address of an array of InventoryItem objects
Address
null
null
null
null
inventory[1]
inventory[0]
inventory[3]
inventory[2]
nullinventory[4]
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-55
Arrays of Objects• Each element needs to be assigned something to
reference.for (int i = 0; i < inventory.length; i++) inventory[i] = new InventoryItem( );
• Example (next slide): ObjectArray.java
The inventory variable holds the address of an InventoryItem array
Address
Address
Address
Address
Address
inventory[1]
inventory[0]
inventory[3]
inventory[2]
description: units:
“”0
description: units:
“”0
description: units:
“”0
description: units:
“”0
description: units:
“”0
Addressinventory[4]
Constructor for InventoryItem initializes each of these items
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-56
Object Array
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-57
UML Diagram of Arrays of Objects
ClassRollManager class has an attribute that is an array of ClassRoll objects named classRolls created by
ClassRollManager’s constructor
Each ClassRoll object has-a array of Student objects as an attribute that is instantiated in
the ClassRoll constructor
In Astah
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-58
The Sequential Search Algorithm• A search algorithm is a method of locating a
specific item in a larger collection of data Locating a person in an array of 10,000 People Locating a book in an array of 100,000 Books Locating a part in an array of 20,000 Parts
• The sequential search algorithm uses a loop to: sequentially step through an array, compare each element with the search key (the item
for which we are searching), and stop when the first of these occurs:
• the value is found or• the end of the array is encountered.
• See example (next slide): SearchArray.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-59
Sequential Search
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-60
Selection Sort
• In a selection sort algorithm: The largest value in the array is located and
exchanged with the last element Then the next largest value is located and
exchanged with the next to last element This process continues until all of the elements have
been placed in their proper order See example (next 4 slides):
SelectionSortDemo.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-61
Selection Sort – How it Works78
91
53
66
67
89
Find Largest78
89
53
66
67
91
Exchange with …
… the last item
Largest is now last
78
89
53
66
67
91R
epeat the process on the
rest of the values –
exchanges 89 and 67 to get …
78
67
53
66
8991
Repeat
process on the rest of the item
s
Largest two are now the last two
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-62
Exchanging two values
• int a = 7, b = 4;Cannot simply say a=b; b=a; because that
would give 4 in both a and b - the original value of a is lost
Must save original value of a in temporary holding area
int temp = a; // save a in tempa = b; // copy b into ab = temp; // replace b with temp
Now a = 4 and b = 7
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-63
Demo of exchanging two values
temp must be same type as a and b Output
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-64
Selection Sort
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-65
Selection Sort
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-66
Binary Search• A binary search:
requires an array that is already sorted into ascending order starts with the element in the middle of the array If that element is the desired value, the search is over
• Otherwise, the value in the middle element is either greater or less than the desired value
• If it is greater than the desired value, search in the first half of the array and do not consider the other half as the value cannot be there
• Otherwise, search the last half of the array and discard the first half Repeat as needed, adjusting start and end points of the
search to search only that part of the array that might contain the value being sought
• See example (next slide): BinarySearchDemo.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-67
Binary Search Demo
Not yet found
while not found and more to search
find middle
is middle one the value we are trying to find?
if not, which side of middle does it fall on
discard last half
Discard first half
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-68
Two-Dimensional Arrays
• A two-dimensional array is an array of arrays • It can be thought of as having both rows and
columns
row 0
column 1 column 2 column 3column 0
row 1
row 2
row 3
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-69
Example Two-Dimensional Array
Test 0 Test 1 Test 2Student 0 87 92 85
Student 1 71 68 83
Student 2 54 62 48
Student 3 89 93 88
Student 4 97 100 98
Student 5 86 71 93
Student 6 43 0 38
Student 7 100 100 100
Student 8 76 79 87
Student 9 63 88 100
Student 10 85 74 53
• Two dimensional array
• 11 rows
• 3 columns
• Columns represent 3 tests given in the course
• Rows represent 11 students in the class
• Student 0 made 85 on Test 2
• Student 2 made 54 on Test 0
• Student 7 had good grades, but Student 2 did not do as well
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-70
• Declaring a two-dimensional array requires two sets of brackets and two size declarators The first one is for the number of rows The second one is for the number of columns
double[][] scores = new double[3][4];
• The two sets of brackets in the data type indicate that the scores variable will reference a two-dimensional array
• Notice that each size declarator is enclosed in its own set of brackets
Two-Dimensional Arrays
two dimensional array rows columns
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-71
Accessing Two-Dimensional Array Elements
• When processing the data in a two-dimensional array, each element has two subscripts: the first is for its row and the second is for its column
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-72
Accessing Two-Dimensional Array Elements
scores[0][3]scores[0][2]scores[0][1]scores[0][0]row 0
column 1 column 2 column 3column 0
row 1
row 2
The scores variableholds the address of a2D array of doubles
Address
scores[1][3]scores[1][2]scores[1][1]scores[1][0]
scores[2][3]scores[2][2]scores[2][1]scores[2][0]
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-73
Accessing Two-Dimensional Array Elements
Accessing one of the elements in a two-dimensional array requires the use of both row and column subscripts
scores[2][1] = 95;
0000row 0
column 1 column 2 column 3column 0
row 1
row 2
Address
0000
00950
The scores variableholds the address of a2D array of doubles
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-74
Accessing Two-Dimensional Array Elements
• Programs that process two-dimensional arrays often use nested loops
• To fill the scores array:for (int row = 0; row < 3; row++){ for (int col = 0; col < 4; col++){
System.out.print("Enter a score: "); scores[row][col] = keyboard.nextDouble(); }}
Number of rows, not the largest subscript
Number of columns, not the largest subscript
keyboard references a Scanner object
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-75
Accessing Two-Dimensional Array Elements
• To display the scores array:for (int row = 0; row < 3; row++){ for (int col = 0; col < 4; col++){
System.out.println(scores[row][col]); }}
• See example on next slide: CorpSales.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-76
Corporate Sales Example
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-77
Initializing a Two-Dimensional Array• Initializing a two-dimensional array requires
enclosing each row’s initialization list in its own set of bracesint[][] numbers = { {1, 2, 3}, {4, 5, 6}, {7, 8, 9} };
• Java automatically creates the array and fills its elements with the initialization values row 0 {1, 2, 3} row 1 {4, 5, 6} row 2 {7, 8, 9}
• Declares an array with three rows and three columns
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-78
Initializing a Two-Dimensional Array
321row 0
column 1 column 2column 0
row 1
row 2
Address
654
987
The numbers variableholds the address of a2D array of int values
int[][] numbers = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};produces:
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-79
The length Field
• Two-dimensional arrays are arrays of one-dimensional arrays
• The length field of the array gives the number of rows in the array
• Each row has its own length constant that tells how many columns are in that row
• Each row can have a different number of columns
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-80
The length Field
• To access the length fields of the array:int[][] numbers = { { 1, 2, 3, 4 }, { 5, 6, 7 }, { 9, 10, 11, 12 } };
for (int row = 0; row < numbers.length; row++){ for (int col = 0; col < numbers[row].length; col++) System.out.println(numbers[row][col]);}
• See example (next slide): Lengths.java
Rows may have varying
lengths
Number of rows
Length of this row
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-81
Array Example
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-82
Summing The Elements of a Two-Dimensional Array
int[][] numbers = { { 1, 2, 3, 4 }, {5, 6, 7, 8}, {9, 10, 11, 12} };int total;total = 0;for (int row = 0; row < numbers.length; row++){ for (int col = 0; col < numbers[row].length; col++) total += numbers[row][col];}
System.out.println("The total is " + total);
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-83
Summing The Rows of a Two-Dimensional Array
int[][] numbers = {{ 1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};int total;
for (int row = 0; row < numbers.length; row++){ total = 0; for (int col = 0; col < numbers[row].length; col++) total += numbers[row][col]; System.out.println("Total of row " + row + " is " + total);}
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-84
Summing The Columns of a Two-Dimensional Array
int[][] numbers = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};int total;
for (int col = 0; col < numbers[0].length; col++){ total = 0; for (int row = 0; row < numbers.length; row++) total += numbers[row][col]; System.out.println("Total of column " + col + " is " + total);}
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-85
Passing and Returning Two-Dimensional Array References• There is no difference between passing a single
or two-dimensional array as an argument to a method
• The method must accept a two-dimensional array as a parameter
• See example on next slide: Pass2Darray.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-86
Passing 2D Array
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-87
Ragged Arrays• When the rows of a two-dimensional array are of
different lengths, the array is known as a ragged array• You can create a ragged array by creating a two-
dimensional array with a specific number of rows, but no specific number of columns
int [][] ragged = new int [4][];• Then create the individual rows, perhaps with different
lengthsragged[0] = new int [3];ragged[1] = new int [4];ragged[2] = new int [5];ragged[3] = new int [6];
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-88
More Than Two Dimensions• Java does not limit the number of dimensions that an
array may have• More than three dimensions is hard to visualize, but
they can be useful in some programming problems
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-89
More Than Two Dimensions - Example
• String[ ][ ][ ][ ][ ] courses =new String [numUniv] [numColleges] [numDept] [numFac] [numCourses];
courses[3][0][1][5][2] is course number 2 taught by instructor number 5 in department number 1 in college number 0 of university number 3 in the state
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-94
The ArrayList Class
• Similar to an array, an ArrayList allows object storage for a collection of items
• Unlike an array, an ArrayList object: Automatically expands when a new item is added Automatically shrinks when items are removed
• Requires: import java.util.ArrayList;
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-95
Creating a Generic ArrayList• Create an ArrayList object with no-args
constructor
ArrayList<String> nameList = new ArrayList<String>( );
ArrayList<Book> library = new ArrayList<Book> ( );
ArrayList<Employee> staff = new ArrayList<Employee>();
ArrayList<Part> inventory = new ArrayList<Part> ( );
ArrayList<Food> groceries = new ArrayList<Food> ( );
Type of Data stored in ArrayList
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-96
Adding data to an ArrayList and using it
• To populate the ArrayList<String> named nameList, use the add method:
nameList.add (“Cynthia");nameList.add (“Eric");nameList.add (“Michael”);
• To get the current size, call the size method – no length field for an ArrayList
int n = nameList.size(); // returns 3• Cannot use subscripts with ArrayList objects
Must use methods such as add, get, set, and remove instead
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-97
Creating and Using an ArrayList
• To access items in an ArrayList, use the get methodnameList.get(3); // retrieve 4th item
In this statement, 3 is the index of the item to get. The index starts with 0 as with ordinary arrays
• Example (next slide): ArrayListDemo1.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-98
Generic ArrayList Demo1
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-99
Using an ArrayList• The ArrayList class's toString method returns a
string representing all items in the ArrayListSystem.out.println(nameList);
This statement yields :[ James, Catherine, Bill ]
• The ArrayList class's remove method removes designated item from the ArrayList
nameList.remove(1); This statement removes the second item and moves the items
after it up to fill the vacated position• See example (next slide): ArrayListDemo3.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-100
ArrayList Demo3
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-101
Using an ArrayList• The ArrayList class's add method with one
argument adds new items to the end of the ArrayList• To insert items at a location of choice, use
the add method with two arguments:nameList.add(1, “Jeff");
This statement inserts the String “Jeff" at index 1 All subsequent items move down one position to make room for
the newly inserted value • To replace an existing item, use the set method:
nameList.set(1, “Steven");
This statement replaces “Jeff” with “Steven”• See example on next slide: ArrayListDemo4.java
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-102
ArrayList Demo4
size gives the number of items currently in the
ArrayList
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-103
Using an ArrayList
• An ArrayList has a capacity, which is the number of items it can hold without increasing its size
• The default capacity of an ArrayList is 10 items
• To designate a different initial capacity, use a parameterized constructor:
ArrayList<Gismo> list = new ArrayList<Gismo>(100);
Initial Capacity
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-104
Generic ArrayList Demo2
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-105
Generic ArrayList Demo3
Enhanced for loop works with
ArrayLists as well
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 7-108
Some other ArrayList methods• Documentation for ArrayList methods is here
Method signature Purposeclear ( ) Remove all entries from the ArrayList
contains (Object o) Is the object in the ArrayList (true or false)
indexOf (Object o) Return the index of the first place in ArrayList where the object o is found; return -1 if not found
isEmpty ( ) True or false – the ArrayList contains no entries
toArray ( ) Returns an array of items of the exact size and contents as the ArrayList
size ( ) Returns an integer indicating how many items are currently in the ArrayList