DoublyLinkedList_Solution

java

School

University of Ottawa *

*We aren’t endorsed by this school

Course

1521

Subject

Computer Science

Date

Oct 30, 2023

Type

java

Pages

Uploaded by LieutenantPencilHummingbird25

import java.util.Iterator; import java.util.NoSuchElementException; import java.lang.NullPointerException; import java.lang.IndexOutOfBoundsException; interface List<E extends Comparable> { boolean add(E elem); E get(int index); boolean remove(E elem); int size(); boolean isEmpty(); E rec_get(int index); boolean rec_remove(E elem); int rec_size(); } public class DoublyLinkedList_Solution<E extends Comparable> implements List<E>{ private int n; // Le nombre des l ments dans la liste � � private Node head; private Node factice; // Le noeud fictif public DoublyLinkedList_Solution() { n = 0; factice = new Node(); factice.next = factice; factice.prev = factice; head = factice; } // La classe Node private class Node { private E value; private Node next; private Node prev; } public boolean isEmpty() { return n == 0; } public int size() { return n; } // Ajouter un l ment la liste � � � public boolean add(E elem) { if (elem == null) { throw new NullPointerException("Element null"); } Node last = factice.prev; Node x = new Node(); x.value = elem; x.next = factice; x.prev = last; factice.prev = x; last.next = x; n++; return true; }

public E get(int index) { if (index < 0 || index >= n ) { throw new IndexOutOfBoundsException(index); } Node current = head; for (int i = 0; i <= index; i++) { current = current.next; } return current.value; } public boolean remove(E elem) { if (elem == null) { throw new NullPointerException("Element null"); } Node current = head.next; for (int i = 0; i < n; i++) { if (current.value.equals(elem)) { current.prev.next = current.next; current.next.prev = current.prev; n--; return true; } current = current.next; } return false; } public E rec_get(int index) { if (index < 0) { throw new IndexOutOfBoundsException(index); } return rec_get(index, head); } private E rec_get(int index, Node current) { if (current.next == factice) { throw new IndexOutOfBoundsException(index); } if (index == 0) { return current.next.value; } return rec_get(index - 1, current.next); } public boolean rec_remove (E elem) { if (elem == null) { throw new NullPointerException("Element null"); } return rec_remove(elem, head); } private boolean rec_remove (E elem, Node current) { if (current.next == factice) { throw new NoSuchElementException(); } if (current.next.value.equals(elem)) { current.next = current.next.next; current.next.prev = current;

n--; return true; } else { return rec_remove(elem, current.next); } } private int rec_size(Node current){ if (current.next == factice) { return 0; // cas de base } return 1 + rec_size(current.next); } public int rec_size() { return rec_size(head); } public Iterator<E> iterator() { return new DoublyLinkedListIterator(); } private class DoublyLinkedListIterator implements Iterator<E> { private Node current = head.next; // Le noeud retourner par la m thode � next private int index = 0; public boolean hasNext() { return index < n; } public E next() { if (!hasNext()) throw new NoSuchElementException(); E value = current.value; current = current.next; index++; return value; } } public String toString() { StringBuilder s = new StringBuilder(); Iterator<E> it = this.iterator(); while(it.hasNext()) s.append(it.next() + " "); s.append(" (size = " + n +")"); s.append(" (rec_size = " + rec_size() +")"); return s.toString(); } // Fonction main pour tester les m thodes de la classe � public static void main(String[] args) { int n = Integer.parseInt(args[0]); /*****************TRAITEMENT ITERATIF**************************/ // Ajouter les l ments 1, ..., n � � System.out.println(n + " Adding the square of each index"); DoublyLinkedList_Solution<Integer> list = new DoublyLinkedList_Solution<Integer>(); for (int i = 0; i < n; i++)

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

list.add(i*i); System.out.println(list); list.remove(0); System.out.println(list); list.remove(81); System.out.println(list); list.remove(25); System.out.println(list); list.add(70); System.out.println(list); list.add(80); System.out.println(list); list.remove(49); System.out.println(list); for (int i = 0; i < list.size(); i++) { System.out.println("El ment index "+ i + ": " + list.get(i)); � � } /*****************TRAITEMENT RECURSIF**************************/ list = new DoublyLinkedList_Solution<Integer>(); for (int i = 0; i < n; i++) list.add(i*i); System.out.println(list); list.rec_remove(0); System.out.println(list); list.rec_remove(81); System.out.println(list); list.rec_remove(25); System.out.println(list); list.add(70); System.out.println(list); list.add(80); System.out.println(list); list.rec_remove(49); System.out.println(list); for (int i = 0; i < list.rec_size(); i++) { System.out.println("El ment index "+ i + ": " + � � list.rec_get(i)); } } }

Related Documents

LAB 2 (Algebra) - Google Docs.pdf

HW 2 User Authen.pdf

FloydWarshall_DP-1.pdf

CarMatching_template.xlsx

LEARNING OBJECTIVES FOR BIOS 108 EXAM 1.docx

Module 1 quiz.docx

IST341_syllabus_spring22(2).pdf

Sound_Based_Machine_Fault_Diagnosis_Syst.pdf

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Microsoft Visual C#

Computer Science

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Cengage Learning,

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781305480537

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

SEE MORE TEXTBOOKS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT