Implement a lastIndex method for the LinkedIntList class you worked on for HW4.  This method takes an int argument and returns the largest index such that the int argument appears at that index in the list.  If the int argument does not appear in the list, then -1 is returned.  For example if the list example contained the numbers [4, -1, 2, 7, -1, 3] in that order, then example.lastIndex(-1) should return 4 and example.lastIndex(5) should return -1. In the text area below, write the definition of the lastIndex method.  (In other words, write the code that should replace the //TODO comment.)  Your code cannot call any methods. public class LinkedIntList {       private class Node {         private int item;         private Node next;           public Node() {}           public Node(int number, Node nextNode) {             item = number;             next = nextNode;         }     }       private Node first; // first node of the list       public LinkedIntList() {         first = null;     }       /* Other LinkedIntList methods not listed here for the sake of space */       public int lastIndex(int target) {         // TODO     } }

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Implement a lastIndex method for the LinkedIntList class you worked on for HW4.  This method takes an int argument and returns the largest index such that the int argument appears at that index in the list.  If the int argument does not appear in the list, then -1 is returned.  For example if the list example contained the numbers [4, -1, 2, 7, -1, 3] in that order, then example.lastIndex(-1) should return 4 and example.lastIndex(5) should return -1.

In the text area below, write the definition of the lastIndex method.  (In other words, write the code that should replace the //TODO comment.)  Your code cannot call any methods.

public class LinkedIntList {
 
    private class Node {
        private int item;
        private Node next;
 
        public Node() {}
 
        public Node(int number, Node nextNode) {
            item = number;
            next = nextNode;
        }
    }
 
    private Node first; // first node of the list
 
    public LinkedIntList() {
        first = null;
    }
 
    /* Other LinkedIntList methods not listed here for the sake of space */
 
    public int lastIndex(int target) {
        // TODO
    }
}
Expert Solution
Step 1

Solution:

 

There is no //TODO comment in the code mentioned in comment

 

Hence, you can insert lastIndex function code after LinkedList Constructor.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY