Building Java Programs: A Back To Basics Approach, Loose Leaf Edition (5th Edition)
Building Java Programs: A Back To Basics Approach, Loose Leaf Edition (5th Edition)
5th Edition
ISBN: 9780135472118
Author: Stuart Reges, Marty Stepp
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 15, Problem 1E

Explanation of Solution

Adding the “lastIndexOf” methods in “ArrayIntList” class:

//definition of "ArrayIntList" class

public class ArrayIntList

{

    //declare the required variables

    private int[] elementData;

    private int size;

    //refer the remaining methods in the textbook

    //definition of "lastIndexOf" method

    public int lastIndexOf(int value)

    {

/*iterate "i" until it reaches the size of an array*/

        for (int i = size - 1; i >= 0; i--)

        {

            //check the condition

            if (elementData[i] == value)

            {

                //return the "i" value

                return i;

            }

        }

        //return the value

        return -1;

    }

}

Explanation:

In the above program, the “ArrayIntList” is the class name,

  • Inside the “ArrayIntList” class, declare the “elementData”, and “size” variables as a private integer datatype.
    • The “lastIndexOf” method is defined inside the “ArrayIntList” class with the integer value as the parameter.
      • The “for” loop is used to iterate the value until it reaches size of an array.
        • The “if” loop is used to check whether the array of element value is equal to passed value.
          • The “ith” position of an array value is returned.
      • If the value is not in an array return the -1 value.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
the nagle algorithm, built into most tcp implementations, requires the sender to hold a partial segment's worth of data (even if pushed) until either a full segment accumulates or the most recent outstanding ack arrives. (a) suppose the letters abcdefghi are sent, one per second, over a tcp connection with an rtt of 4.1 seconds. draw a timeline indicating when each packet is sent and what it contains.
Just need some assistance with number 3 please, in C#
How do we find the possible  final values of variable x in the following program.   Int x=0; sem  s1=1, s2 =0;   CO P(s2); P(s1); x=x*2; V(s1); // P(s1); x=x*x; V(s1); // P(s1); x=x+3; V(s2); V(s1); Oc
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education