SlideShare a Scribd company logo

Hi,I have added the methods and main class as per your requirement.pdf

A
annaelctronics

The document contains Java code for a linked list implementation, including the main class 'mylinkedlisttest' and associated methods for adding, retrieving, and removing elements. It demonstrates functionality such as adding elements to both ends, removing elements, and displaying the contents of the list. Overall, the code provides a framework for managing a linked list with various utility methods.

Education
1 of 18
Download to read offline
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
Hi, I have added the methods and main class as per your requirement. it is working fine now. Highlighted the code changes. MyLinkedListTest.java public class MyLinkedListTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub MyLinkedList list = new MyLinkedList(); list.addFirst("AAAAA"); list.add("1"); list.add("2"); list.add("3"); list.addLast("ZZZZZ"); System.out.println("Linked List Elements : "+list.toString()); System.out.println("First element: "+list.getFirst()); System.out.println("Second element: "+list.getLast()); System.out.println("Removed First Element: "+list.removeFirst()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed Last Element: "+list.removeLast()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed all element: "); list.removeAll(); System.out.println("Now Linked List Elements : "+list.toString()); } } MyLinkedList.java public class MyLinkedList extends MyAbstractList { private Node head, tail; /** Create a default list */ public MyLinkedList() {
} /** Create a list from an array of objects */ public MyLinkedList(E[] objects) { super(objects); } /** Return the head element in the list */ public E getFirst() { if (size == 0) { return null; } else { return (E)head.element; } } /** Return the last element in the list */ public E getLast() { if (size == 0) { return null; } else { return (E)tail.element; } } /** Add an element to the beginning of the list */ public void addFirst(E e) { Node newNode = new Node(e); // Create a new node newNode.next = head; // link the new node with the head head = newNode; // head points to the new node size++; // Increase list size if (tail == null) // the new node is the only node in list tail = head; } /** Add an element to the end of the list */ public void addLast(E e) { Node newNode = new Node(e); // Create a new for element e if (tail == null) {
head = tail = newNode; // The new node is the only node in list } else { tail.next = newNode; // Link the new with the last node tail = tail.next; // tail now points to the last node } size++; // Increase size } /** Add a new element at the specified index in this list * The index of the head element is 0 */ public void add(int index, E e) { if (index == 0) { addFirst(e); } else if (index >= size) { addLast(e); } else { Node current = head; for (int i = 1; i < index; i++) { current = current.next; } Node temp = current.next; current.next = new Node(e); (current.next).next = temp; size++; } } /** Remove the head node and * return the object that is contained in the removed node. */ public E removeFirst() { if (size == 0) { return null; } else {
Node temp = head; head = head.next; size--; if (head == null) { tail = null; } return (E)temp.element; } } /** Remove all elements from list */ public void removeAll() { while(true) { if (size == 0) { break; } else { Node temp = head; head = head.next; size--; if (head == null) { tail = null; } } } } /** Remove the last node and * return the object that is contained in the removed node. */ public E removeLast() { if (size == 0) { return null; } else if (size == 1) { Node temp = head; head = tail = null; size = 0;
return (E)temp.element; } else { Node current = head; for (int i = 0; i < size - 2; i++) { current = current.next; } Node temp = tail; tail = current; tail.next = null; size--; return (E)temp.element; } } /** Remove the element at the specified position in this list. * Return the element that was removed from the list. */ public E remove(int index) { if (index < 0 || index >= size) { return null; } else if (index == 0) { return removeFirst(); } else if (index == size - 1) { return removeLast(); } else { Node previous = head; for (int i = 1; i < index; i++) { previous = previous.next; } Node current = previous.next; previous.next = current.next; size--; return (E)current.element; }
} /** Override toString() to return elements in the list */ public String toString() { StringBuilder result = new StringBuilder("["); Node current = head; for (int i = 0; i < size; i++) { result.append(current.element); current = current.next; if (current != null) { result.append(", "); // Separate two elements with a comma } } result.append("]"); // Insert the closing ] in the string return result.toString(); } /** Clear the list */ public void clear() { head = tail = null; } /** Return true if this list contains the element o */ public boolean contains(E e) { System.out.println("Implementation left as an exercise"); return true; } /** Return the element from this list at the specified index */ public E get(int index) { System.out.println("Implementation left as an exercise"); return null; } /** Return the index of the head matching element in this list. * Return -1 if no match. */ public int indexOf(E e) { System.out.println("Implementation left as an exercise"); return 0;
} /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e) { System.out.println("Implementation left as an exercise"); return 0; } /** Replace the element at the specified position in this list * with the specified element. */ public E set(int index, E e) { System.out.println("Implementation left as an exercise"); return null; } private static class Node { E element; Node next; public Node(E element) { this.element = element; } } } MyAbstractList.java public abstract class MyAbstractList implements MyList { protected int size = 0; // The size of the list /** Create a default list */ protected MyAbstractList() { } /** Create a list from an array of objects */ protected MyAbstractList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); } /** Add a new element at the end of this list */ public void add(E e) { add(size, e);
} /** Return true if this list contains no elements */ public boolean isEmpty() { return size == 0; } /** Return the number of elements in this list */ public int size() { return size; } /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e) { if (indexOf(e) >= 0) { remove(indexOf(e)); return true; } else return false; } } MyList.java public interface MyList { /** Add a new element at the end of this list */ public void add(E e); /** Add a new element at the specified index in this list */ public void add(int index, E e); /** Clear the list */ public void clear(); /** Return true if this list contains the element */ public boolean contains(E e); /** Return the element from this list at the specified index */ public E get(int index); /** Return the index of the first matching element in this list. * Return -1 if no match. */
public int indexOf(E e); /** Return true if this list contains no elements */ public boolean isEmpty(); /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e); /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e); /** Remove the element at the specified position in this list * Shift any subsequent elements to the left. * Return the element that was removed from the list. */ public E remove(int index); /** Replace the element at the specified position in this list * with the specified element and returns the new set. */ public Object set(int index, E e); /** Return the number of elements in this list */ public int size(); } Output: Linked List Elements : [AAAAA, 1, 2, 3, ZZZZZ] First element: AAAAA Second element: ZZZZZ Removed First Element: AAAAA Now Linked List Elements : [1, 2, 3, ZZZZZ] Removed Last Element: ZZZZZ Now Linked List Elements : [1, 2, 3] Removed all element: Now Linked List Elements : [] Solution Hi, I have added the methods and main class as per your requirement. it is working fine now. Highlighted the code changes.
MyLinkedListTest.java public class MyLinkedListTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub MyLinkedList list = new MyLinkedList(); list.addFirst("AAAAA"); list.add("1"); list.add("2"); list.add("3"); list.addLast("ZZZZZ"); System.out.println("Linked List Elements : "+list.toString()); System.out.println("First element: "+list.getFirst()); System.out.println("Second element: "+list.getLast()); System.out.println("Removed First Element: "+list.removeFirst()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed Last Element: "+list.removeLast()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed all element: "); list.removeAll(); System.out.println("Now Linked List Elements : "+list.toString()); } } MyLinkedList.java public class MyLinkedList extends MyAbstractList { private Node head, tail; /** Create a default list */ public MyLinkedList() { } /** Create a list from an array of objects */ public MyLinkedList(E[] objects) { super(objects);
} /** Return the head element in the list */ public E getFirst() { if (size == 0) { return null; } else { return (E)head.element; } } /** Return the last element in the list */ public E getLast() { if (size == 0) { return null; } else { return (E)tail.element; } } /** Add an element to the beginning of the list */ public void addFirst(E e) { Node newNode = new Node(e); // Create a new node newNode.next = head; // link the new node with the head head = newNode; // head points to the new node size++; // Increase list size if (tail == null) // the new node is the only node in list tail = head; } /** Add an element to the end of the list */ public void addLast(E e) { Node newNode = new Node(e); // Create a new for element e if (tail == null) { head = tail = newNode; // The new node is the only node in list } else { tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node } size++; // Increase size } /** Add a new element at the specified index in this list * The index of the head element is 0 */ public void add(int index, E e) { if (index == 0) { addFirst(e); } else if (index >= size) { addLast(e); } else { Node current = head; for (int i = 1; i < index; i++) { current = current.next; } Node temp = current.next; current.next = new Node(e); (current.next).next = temp; size++; } } /** Remove the head node and * return the object that is contained in the removed node. */ public E removeFirst() { if (size == 0) { return null; } else { Node temp = head; head = head.next; size--; if (head == null) {
tail = null; } return (E)temp.element; } } /** Remove all elements from list */ public void removeAll() { while(true) { if (size == 0) { break; } else { Node temp = head; head = head.next; size--; if (head == null) { tail = null; } } } } /** Remove the last node and * return the object that is contained in the removed node. */ public E removeLast() { if (size == 0) { return null; } else if (size == 1) { Node temp = head; head = tail = null; size = 0; return (E)temp.element; } else { Node current = head;
for (int i = 0; i < size - 2; i++) { current = current.next; } Node temp = tail; tail = current; tail.next = null; size--; return (E)temp.element; } } /** Remove the element at the specified position in this list. * Return the element that was removed from the list. */ public E remove(int index) { if (index < 0 || index >= size) { return null; } else if (index == 0) { return removeFirst(); } else if (index == size - 1) { return removeLast(); } else { Node previous = head; for (int i = 1; i < index; i++) { previous = previous.next; } Node current = previous.next; previous.next = current.next; size--; return (E)current.element; } } /** Override toString() to return elements in the list */ public String toString() { StringBuilder result = new StringBuilder("[");
Node current = head; for (int i = 0; i < size; i++) { result.append(current.element); current = current.next; if (current != null) { result.append(", "); // Separate two elements with a comma } } result.append("]"); // Insert the closing ] in the string return result.toString(); } /** Clear the list */ public void clear() { head = tail = null; } /** Return true if this list contains the element o */ public boolean contains(E e) { System.out.println("Implementation left as an exercise"); return true; } /** Return the element from this list at the specified index */ public E get(int index) { System.out.println("Implementation left as an exercise"); return null; } /** Return the index of the head matching element in this list. * Return -1 if no match. */ public int indexOf(E e) { System.out.println("Implementation left as an exercise"); return 0; } /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e) {
System.out.println("Implementation left as an exercise"); return 0; } /** Replace the element at the specified position in this list * with the specified element. */ public E set(int index, E e) { System.out.println("Implementation left as an exercise"); return null; } private static class Node { E element; Node next; public Node(E element) { this.element = element; } } } MyAbstractList.java public abstract class MyAbstractList implements MyList { protected int size = 0; // The size of the list /** Create a default list */ protected MyAbstractList() { } /** Create a list from an array of objects */ protected MyAbstractList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); } /** Add a new element at the end of this list */ public void add(E e) { add(size, e); } /** Return true if this list contains no elements */ public boolean isEmpty() { return size == 0;
} /** Return the number of elements in this list */ public int size() { return size; } /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e) { if (indexOf(e) >= 0) { remove(indexOf(e)); return true; } else return false; } } MyList.java public interface MyList { /** Add a new element at the end of this list */ public void add(E e); /** Add a new element at the specified index in this list */ public void add(int index, E e); /** Clear the list */ public void clear(); /** Return true if this list contains the element */ public boolean contains(E e); /** Return the element from this list at the specified index */ public E get(int index); /** Return the index of the first matching element in this list. * Return -1 if no match. */ public int indexOf(E e); /** Return true if this list contains no elements */ public boolean isEmpty(); /** Return the index of the last matching element in this list
* Return -1 if no match. */ public int lastIndexOf(E e); /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e); /** Remove the element at the specified position in this list * Shift any subsequent elements to the left. * Return the element that was removed from the list. */ public E remove(int index); /** Replace the element at the specified position in this list * with the specified element and returns the new set. */ public Object set(int index, E e); /** Return the number of elements in this list */ public int size(); } Output: Linked List Elements : [AAAAA, 1, 2, 3, ZZZZZ] First element: AAAAA Second element: ZZZZZ Removed First Element: AAAAA Now Linked List Elements : [1, 2, 3, ZZZZZ] Removed Last Element: ZZZZZ Now Linked List Elements : [1, 2, 3] Removed all element: Now Linked List Elements : []

More Related Content

PDF
Given below is the completed implementation of MyLinkedList class. O.pdf
info430661
 
PDF
public class MyLinkedListltE extends ComparableltEgtg.pdf
accostinternational
 
PDF
Note             Given Code modified as required and required met.pdf
Ankitchhabra28
 
PDF
import java-util--- public class MyLinkedList{ public static void.pdf
asarudheen07
 
PDF
STAGE 2 The Methods 65 points Implement all the methods t.pdf
babitasingh698417
 
PDF
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
xlynettalampleyxc
 
PDF
Fix my codeCode.pdf
Conint29
 
PDF
Implementation The starter code includes List.java. You should not c.pdf
maheshkumar12354
 
Given below is the completed implementation of MyLinkedList class. O.pdf
info430661
 
public class MyLinkedListltE extends ComparableltEgtg.pdf
accostinternational
 
Note             Given Code modified as required and required met.pdf
Ankitchhabra28
 
import java-util--- public class MyLinkedList{ public static void.pdf
asarudheen07
 
STAGE 2 The Methods 65 points Implement all the methods t.pdf
babitasingh698417
 
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
xlynettalampleyxc
 
Fix my codeCode.pdf
Conint29
 
Implementation The starter code includes List.java. You should not c.pdf
maheshkumar12354
 

Similar to Hi,I have added the methods and main class as per your requirement.pdf (20)

PDF
please i need help Im writing a program to test the merge sort alg.pdf
ezonesolutions
 
PDF
The LinkedList1 class implements a Linked list. class.pdf
malavshah9013
 
PDF
Please help me to make a programming project I have to sue them today- (1).pdf
seoagam1
 
PDF
import java.util.Iterator; import java.util.NoSuchElementException; .pdf
deepakangel
 
PDF
hi i have to write a java program involving link lists. i have a pro.pdf
archgeetsenterprises
 
PDF
LabProgram.javaimport java.util.NoSuchElementException;public .pdf
fantasiatheoutofthef
 
PDF
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
freddysarabia1
 
DOCX
Please complete all the code as per instructions in Java programming.docx
cgraciela1
 
PDF
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
mail931892
 
PDF
Note- Can someone help me with the Public boolean add(E value) method.pdf
Stewart29UReesa
 
DOCX
The MyLinkedList class used in Listing 24.6 is a one-way directional .docx
Komlin1
 
PDF
Implement the additional 5 methods as indicated in the LinkedList fi.pdf
footstatus
 
PDF
Copy your completed LinkedList class from Lab 3 into the LinkedList..pdf
facevenky
 
DOCX
Note- Can someone help me with the private E get(int index- int curren (1).docx
VictorzH8Bondx
 
PDF
Write a Java Class to Implement a Generic Linked ListYour list mus.pdf
rozakashif85
 
PDF
File LinkedList.java Defines a doubly-l.pdf
Conint29
 
PDF
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
arrowmobile
 
PDF
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
mallik3000
 
PDF
Rewrite this code so it can use a generic type instead of integers. .pdf
alphaagenciesindia
 
PDF
Note- Can someone help me with the public boolean isEmpty()- public bo.pdf
Augstore
 
please i need help Im writing a program to test the merge sort alg.pdf
ezonesolutions
 
The LinkedList1 class implements a Linked list. class.pdf
malavshah9013
 
Please help me to make a programming project I have to sue them today- (1).pdf
seoagam1
 
import java.util.Iterator; import java.util.NoSuchElementException; .pdf
deepakangel
 
hi i have to write a java program involving link lists. i have a pro.pdf
archgeetsenterprises
 
LabProgram.javaimport java.util.NoSuchElementException;public .pdf
fantasiatheoutofthef
 
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
freddysarabia1
 
Please complete all the code as per instructions in Java programming.docx
cgraciela1
 
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
mail931892
 
Note- Can someone help me with the Public boolean add(E value) method.pdf
Stewart29UReesa
 
The MyLinkedList class used in Listing 24.6 is a one-way directional .docx
Komlin1
 
Implement the additional 5 methods as indicated in the LinkedList fi.pdf
footstatus
 
Copy your completed LinkedList class from Lab 3 into the LinkedList..pdf
facevenky
 
Note- Can someone help me with the private E get(int index- int curren (1).docx
VictorzH8Bondx
 
Write a Java Class to Implement a Generic Linked ListYour list mus.pdf
rozakashif85
 
File LinkedList.java Defines a doubly-l.pdf
Conint29
 
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
arrowmobile
 
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
mallik3000
 
Rewrite this code so it can use a generic type instead of integers. .pdf
alphaagenciesindia
 
Note- Can someone help me with the public boolean isEmpty()- public bo.pdf
Augstore
 
Ad

More from annaelctronics (20)

PDF
two singals are expected. one is for CH3, the oth.pdf
annaelctronics
 
PDF
There is in fact a stronger problem, namely 2p C .pdf
annaelctronics
 
PDF
The term Lewis acid refers to a definition of aci.pdf
annaelctronics
 
PDF
NHC(=O)CH3 NH2 OH .pdf
annaelctronics
 
PDF
MnO2 may act as a catalyst.in the other reaction .pdf
annaelctronics
 
PDF
What are P and R hereSolutionWhat are P and R here.pdf
annaelctronics
 
PDF
Intermolecular attractions are attractions betwee.pdf
annaelctronics
 
PDF
It is insoluble in water. .pdf
annaelctronics
 
PDF
Write it using the ^ symbol. For example 1.34 10^6Solutio.pdf
annaelctronics
 
PDF
Xenodiagnosis is the method used to document presesnce of a microorg.pdf
annaelctronics
 
PDF
u(x)= ( -4x)Solutionu(x)= ( -4x).pdf
annaelctronics
 
PDF
There are many more conditions than just the norms of the culture th.pdf
annaelctronics
 
PDF
The three layers of smooth muscle that includes mucosa. innermost tu.pdf
annaelctronics
 
PDF
The independent variable is the one which changes in each plant. Thi.pdf
annaelctronics
 
PDF
Species diversity is more in near island as rate of immigration is m.pdf
annaelctronics
 
PDF
Solution Flies do not have teeth for chewing food.So,like human f.pdf
annaelctronics
 
PDF
Program To change this license header, choose License Heade.pdf
annaelctronics
 
PDF
plexusFormed from anterioe rani o these spinal nervesMajor nerve.pdf
annaelctronics
 
PDF
Ok, so the number of double bond equivalents in the compound is [C4H.pdf
annaelctronics
 
PDF
order of overlap of atomic orbitals from highest extent of overlap t.pdf
annaelctronics
 
two singals are expected. one is for CH3, the oth.pdf
annaelctronics
 
There is in fact a stronger problem, namely 2p C .pdf
annaelctronics
 
The term Lewis acid refers to a definition of aci.pdf
annaelctronics
 
NHC(=O)CH3 NH2 OH .pdf
annaelctronics
 
MnO2 may act as a catalyst.in the other reaction .pdf
annaelctronics
 
What are P and R hereSolutionWhat are P and R here.pdf
annaelctronics
 
Intermolecular attractions are attractions betwee.pdf
annaelctronics
 
It is insoluble in water. .pdf
annaelctronics
 
Write it using the ^ symbol. For example 1.34 10^6Solutio.pdf
annaelctronics
 
Xenodiagnosis is the method used to document presesnce of a microorg.pdf
annaelctronics
 
u(x)= ( -4x)Solutionu(x)= ( -4x).pdf
annaelctronics
 
There are many more conditions than just the norms of the culture th.pdf
annaelctronics
 
The three layers of smooth muscle that includes mucosa. innermost tu.pdf
annaelctronics
 
The independent variable is the one which changes in each plant. Thi.pdf
annaelctronics
 
Species diversity is more in near island as rate of immigration is m.pdf
annaelctronics
 
Solution Flies do not have teeth for chewing food.So,like human f.pdf
annaelctronics
 
Program To change this license header, choose License Heade.pdf
annaelctronics
 
plexusFormed from anterioe rani o these spinal nervesMajor nerve.pdf
annaelctronics
 
Ok, so the number of double bond equivalents in the compound is [C4H.pdf
annaelctronics
 
order of overlap of atomic orbitals from highest extent of overlap t.pdf
annaelctronics
 
Ad

Recently uploaded (20)

PDF
HVAC Specification 2024 according to central public works department
amitrobanipl
 
PPTX
202450812 BayCHI UCSC-SV 20250812 v17.pptx
home
 
PDF
Indian roads congress 037 - 2012 Flexible pavement
offersjackpot
 
PPTX
History, Philosophy and sociology of education (1).pptx
tmdth1
 
PDF
IGGE1 Understanding the Self1234567891011
rhea22labucay
 
PDF
David L Page_DCI Research Study Journey_how Methodology can inform one's prac...
David L Page
 
PPTX
B.Sc. DS Unit 2 Software Engineering.pptx
Dr. Pallawi Bulakh
 
PDF
1_English_Language_Set_2.pdf probationary
emailjagmeetsingh9
 
DOC
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
ArchitectAFMMohiuddi
 
PDF
Practical Manual AGRO-233 Principles and Practices of Natural Farming
MilindKhedekar2
 
PDF
advance database management system book.pdf
hinamannan364
 
PPTX
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
Medpopz
 
PDF
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
victor kamau
 
PDF
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
S LS
 
PDF
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
navneetgupta711851
 
PDF
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
JohnJerryDalawampu
 
PPTX
Introduction to Building Materials
Mrunali Vasava
 
PDF
Trump Administration's workforce development strategy
Mebane Rash
 
PPTX
Unit 4 Computer Architecture Multicore Processor.pptx
Gunasundari Selvaraj
 
PDF
LDMMIA Reiki Yoga Finals Review Spring Summer
LDMMia Reiki Lectures
 
HVAC Specification 2024 according to central public works department
amitrobanipl
 
202450812 BayCHI UCSC-SV 20250812 v17.pptx
home
 
Indian roads congress 037 - 2012 Flexible pavement
offersjackpot
 
History, Philosophy and sociology of education (1).pptx
tmdth1
 
IGGE1 Understanding the Self1234567891011
rhea22labucay
 
David L Page_DCI Research Study Journey_how Methodology can inform one's prac...
David L Page
 
B.Sc. DS Unit 2 Software Engineering.pptx
Dr. Pallawi Bulakh
 
1_English_Language_Set_2.pdf probationary
emailjagmeetsingh9
 
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
ArchitectAFMMohiuddi
 
Practical Manual AGRO-233 Principles and Practices of Natural Farming
MilindKhedekar2
 
advance database management system book.pdf
hinamannan364
 
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
Medpopz
 
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
victor kamau
 
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
S LS
 
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
navneetgupta711851
 
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
JohnJerryDalawampu
 
Introduction to Building Materials
Mrunali Vasava
 
Trump Administration's workforce development strategy
Mebane Rash
 
Unit 4 Computer Architecture Multicore Processor.pptx
Gunasundari Selvaraj
 
LDMMIA Reiki Yoga Finals Review Spring Summer
LDMMia Reiki Lectures
 

Hi,I have added the methods and main class as per your requirement.pdf

  • 1. Hi, I have added the methods and main class as per your requirement. it is working fine now. Highlighted the code changes. MyLinkedListTest.java public class MyLinkedListTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub MyLinkedList list = new MyLinkedList(); list.addFirst("AAAAA"); list.add("1"); list.add("2"); list.add("3"); list.addLast("ZZZZZ"); System.out.println("Linked List Elements : "+list.toString()); System.out.println("First element: "+list.getFirst()); System.out.println("Second element: "+list.getLast()); System.out.println("Removed First Element: "+list.removeFirst()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed Last Element: "+list.removeLast()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed all element: "); list.removeAll(); System.out.println("Now Linked List Elements : "+list.toString()); } } MyLinkedList.java public class MyLinkedList extends MyAbstractList { private Node head, tail; /** Create a default list */ public MyLinkedList() {
  • 2. } /** Create a list from an array of objects */ public MyLinkedList(E[] objects) { super(objects); } /** Return the head element in the list */ public E getFirst() { if (size == 0) { return null; } else { return (E)head.element; } } /** Return the last element in the list */ public E getLast() { if (size == 0) { return null; } else { return (E)tail.element; } } /** Add an element to the beginning of the list */ public void addFirst(E e) { Node newNode = new Node(e); // Create a new node newNode.next = head; // link the new node with the head head = newNode; // head points to the new node size++; // Increase list size if (tail == null) // the new node is the only node in list tail = head; } /** Add an element to the end of the list */ public void addLast(E e) { Node newNode = new Node(e); // Create a new for element e if (tail == null) {
  • 3. head = tail = newNode; // The new node is the only node in list } else { tail.next = newNode; // Link the new with the last node tail = tail.next; // tail now points to the last node } size++; // Increase size } /** Add a new element at the specified index in this list * The index of the head element is 0 */ public void add(int index, E e) { if (index == 0) { addFirst(e); } else if (index >= size) { addLast(e); } else { Node current = head; for (int i = 1; i < index; i++) { current = current.next; } Node temp = current.next; current.next = new Node(e); (current.next).next = temp; size++; } } /** Remove the head node and * return the object that is contained in the removed node. */ public E removeFirst() { if (size == 0) { return null; } else {
  • 4. Node temp = head; head = head.next; size--; if (head == null) { tail = null; } return (E)temp.element; } } /** Remove all elements from list */ public void removeAll() { while(true) { if (size == 0) { break; } else { Node temp = head; head = head.next; size--; if (head == null) { tail = null; } } } } /** Remove the last node and * return the object that is contained in the removed node. */ public E removeLast() { if (size == 0) { return null; } else if (size == 1) { Node temp = head; head = tail = null; size = 0;
  • 5. return (E)temp.element; } else { Node current = head; for (int i = 0; i < size - 2; i++) { current = current.next; } Node temp = tail; tail = current; tail.next = null; size--; return (E)temp.element; } } /** Remove the element at the specified position in this list. * Return the element that was removed from the list. */ public E remove(int index) { if (index < 0 || index >= size) { return null; } else if (index == 0) { return removeFirst(); } else if (index == size - 1) { return removeLast(); } else { Node previous = head; for (int i = 1; i < index; i++) { previous = previous.next; } Node current = previous.next; previous.next = current.next; size--; return (E)current.element; }
  • 6. } /** Override toString() to return elements in the list */ public String toString() { StringBuilder result = new StringBuilder("["); Node current = head; for (int i = 0; i < size; i++) { result.append(current.element); current = current.next; if (current != null) { result.append(", "); // Separate two elements with a comma } } result.append("]"); // Insert the closing ] in the string return result.toString(); } /** Clear the list */ public void clear() { head = tail = null; } /** Return true if this list contains the element o */ public boolean contains(E e) { System.out.println("Implementation left as an exercise"); return true; } /** Return the element from this list at the specified index */ public E get(int index) { System.out.println("Implementation left as an exercise"); return null; } /** Return the index of the head matching element in this list. * Return -1 if no match. */ public int indexOf(E e) { System.out.println("Implementation left as an exercise"); return 0;
  • 7. } /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e) { System.out.println("Implementation left as an exercise"); return 0; } /** Replace the element at the specified position in this list * with the specified element. */ public E set(int index, E e) { System.out.println("Implementation left as an exercise"); return null; } private static class Node { E element; Node next; public Node(E element) { this.element = element; } } } MyAbstractList.java public abstract class MyAbstractList implements MyList { protected int size = 0; // The size of the list /** Create a default list */ protected MyAbstractList() { } /** Create a list from an array of objects */ protected MyAbstractList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); } /** Add a new element at the end of this list */ public void add(E e) { add(size, e);
  • 8. } /** Return true if this list contains no elements */ public boolean isEmpty() { return size == 0; } /** Return the number of elements in this list */ public int size() { return size; } /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e) { if (indexOf(e) >= 0) { remove(indexOf(e)); return true; } else return false; } } MyList.java public interface MyList { /** Add a new element at the end of this list */ public void add(E e); /** Add a new element at the specified index in this list */ public void add(int index, E e); /** Clear the list */ public void clear(); /** Return true if this list contains the element */ public boolean contains(E e); /** Return the element from this list at the specified index */ public E get(int index); /** Return the index of the first matching element in this list. * Return -1 if no match. */
  • 9. public int indexOf(E e); /** Return true if this list contains no elements */ public boolean isEmpty(); /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e); /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e); /** Remove the element at the specified position in this list * Shift any subsequent elements to the left. * Return the element that was removed from the list. */ public E remove(int index); /** Replace the element at the specified position in this list * with the specified element and returns the new set. */ public Object set(int index, E e); /** Return the number of elements in this list */ public int size(); } Output: Linked List Elements : [AAAAA, 1, 2, 3, ZZZZZ] First element: AAAAA Second element: ZZZZZ Removed First Element: AAAAA Now Linked List Elements : [1, 2, 3, ZZZZZ] Removed Last Element: ZZZZZ Now Linked List Elements : [1, 2, 3] Removed all element: Now Linked List Elements : [] Solution Hi, I have added the methods and main class as per your requirement. it is working fine now. Highlighted the code changes.
  • 10. MyLinkedListTest.java public class MyLinkedListTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub MyLinkedList list = new MyLinkedList(); list.addFirst("AAAAA"); list.add("1"); list.add("2"); list.add("3"); list.addLast("ZZZZZ"); System.out.println("Linked List Elements : "+list.toString()); System.out.println("First element: "+list.getFirst()); System.out.println("Second element: "+list.getLast()); System.out.println("Removed First Element: "+list.removeFirst()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed Last Element: "+list.removeLast()); System.out.println("Now Linked List Elements : "+list.toString()); System.out.println("Removed all element: "); list.removeAll(); System.out.println("Now Linked List Elements : "+list.toString()); } } MyLinkedList.java public class MyLinkedList extends MyAbstractList { private Node head, tail; /** Create a default list */ public MyLinkedList() { } /** Create a list from an array of objects */ public MyLinkedList(E[] objects) { super(objects);
  • 11. } /** Return the head element in the list */ public E getFirst() { if (size == 0) { return null; } else { return (E)head.element; } } /** Return the last element in the list */ public E getLast() { if (size == 0) { return null; } else { return (E)tail.element; } } /** Add an element to the beginning of the list */ public void addFirst(E e) { Node newNode = new Node(e); // Create a new node newNode.next = head; // link the new node with the head head = newNode; // head points to the new node size++; // Increase list size if (tail == null) // the new node is the only node in list tail = head; } /** Add an element to the end of the list */ public void addLast(E e) { Node newNode = new Node(e); // Create a new for element e if (tail == null) { head = tail = newNode; // The new node is the only node in list } else { tail.next = newNode; // Link the new with the last node
  • 12. tail = tail.next; // tail now points to the last node } size++; // Increase size } /** Add a new element at the specified index in this list * The index of the head element is 0 */ public void add(int index, E e) { if (index == 0) { addFirst(e); } else if (index >= size) { addLast(e); } else { Node current = head; for (int i = 1; i < index; i++) { current = current.next; } Node temp = current.next; current.next = new Node(e); (current.next).next = temp; size++; } } /** Remove the head node and * return the object that is contained in the removed node. */ public E removeFirst() { if (size == 0) { return null; } else { Node temp = head; head = head.next; size--; if (head == null) {
  • 13. tail = null; } return (E)temp.element; } } /** Remove all elements from list */ public void removeAll() { while(true) { if (size == 0) { break; } else { Node temp = head; head = head.next; size--; if (head == null) { tail = null; } } } } /** Remove the last node and * return the object that is contained in the removed node. */ public E removeLast() { if (size == 0) { return null; } else if (size == 1) { Node temp = head; head = tail = null; size = 0; return (E)temp.element; } else { Node current = head;
  • 14. for (int i = 0; i < size - 2; i++) { current = current.next; } Node temp = tail; tail = current; tail.next = null; size--; return (E)temp.element; } } /** Remove the element at the specified position in this list. * Return the element that was removed from the list. */ public E remove(int index) { if (index < 0 || index >= size) { return null; } else if (index == 0) { return removeFirst(); } else if (index == size - 1) { return removeLast(); } else { Node previous = head; for (int i = 1; i < index; i++) { previous = previous.next; } Node current = previous.next; previous.next = current.next; size--; return (E)current.element; } } /** Override toString() to return elements in the list */ public String toString() { StringBuilder result = new StringBuilder("[");
  • 15. Node current = head; for (int i = 0; i < size; i++) { result.append(current.element); current = current.next; if (current != null) { result.append(", "); // Separate two elements with a comma } } result.append("]"); // Insert the closing ] in the string return result.toString(); } /** Clear the list */ public void clear() { head = tail = null; } /** Return true if this list contains the element o */ public boolean contains(E e) { System.out.println("Implementation left as an exercise"); return true; } /** Return the element from this list at the specified index */ public E get(int index) { System.out.println("Implementation left as an exercise"); return null; } /** Return the index of the head matching element in this list. * Return -1 if no match. */ public int indexOf(E e) { System.out.println("Implementation left as an exercise"); return 0; } /** Return the index of the last matching element in this list * Return -1 if no match. */ public int lastIndexOf(E e) {
  • 16. System.out.println("Implementation left as an exercise"); return 0; } /** Replace the element at the specified position in this list * with the specified element. */ public E set(int index, E e) { System.out.println("Implementation left as an exercise"); return null; } private static class Node { E element; Node next; public Node(E element) { this.element = element; } } } MyAbstractList.java public abstract class MyAbstractList implements MyList { protected int size = 0; // The size of the list /** Create a default list */ protected MyAbstractList() { } /** Create a list from an array of objects */ protected MyAbstractList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); } /** Add a new element at the end of this list */ public void add(E e) { add(size, e); } /** Return true if this list contains no elements */ public boolean isEmpty() { return size == 0;
  • 17. } /** Return the number of elements in this list */ public int size() { return size; } /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e) { if (indexOf(e) >= 0) { remove(indexOf(e)); return true; } else return false; } } MyList.java public interface MyList { /** Add a new element at the end of this list */ public void add(E e); /** Add a new element at the specified index in this list */ public void add(int index, E e); /** Clear the list */ public void clear(); /** Return true if this list contains the element */ public boolean contains(E e); /** Return the element from this list at the specified index */ public E get(int index); /** Return the index of the first matching element in this list. * Return -1 if no match. */ public int indexOf(E e); /** Return true if this list contains no elements */ public boolean isEmpty(); /** Return the index of the last matching element in this list
  • 18. * Return -1 if no match. */ public int lastIndexOf(E e); /** Remove the first occurrence of the element o from this list. * Shift any subsequent elements to the left. * Return true if the element is removed. */ public boolean remove(E e); /** Remove the element at the specified position in this list * Shift any subsequent elements to the left. * Return the element that was removed from the list. */ public E remove(int index); /** Replace the element at the specified position in this list * with the specified element and returns the new set. */ public Object set(int index, E e); /** Return the number of elements in this list */ public int size(); } Output: Linked List Elements : [AAAAA, 1, 2, 3, ZZZZZ] First element: AAAAA Second element: ZZZZZ Removed First Element: AAAAA Now Linked List Elements : [1, 2, 3, ZZZZZ] Removed Last Element: ZZZZZ Now Linked List Elements : [1, 2, 3] Removed all element: Now Linked List Elements : []