+ boolean deleted = false;
+ if (isEmpty()) {
+ return deleted;
+ } else if (value == headNode.getData()) {
+ headNode = headNode.getNext();
+ deleted = true;
+ list_counter--;
+ } else {
+ IntNode nodeCursor = headNode;
+ IntNode nodeCursorNext = headNode.getNext();
+ while (nodeCursorNext != null) {
+ if (value == nodeCursorNext.getData()) {
+ nodeCursor.setNext(nodeCursorNext.getNext());
+ deleted = true;
+ list_counter--;
+ break;
+ } else {
+ nodeCursor = nodeCursorNext;
+ nodeCursorNext = nodeCursorNext.getNext();
+ }
+ }
+ }
+ return deleted;
+ }
+
+ public void afficher() {
+ if (isEmpty()) {
+ System.out.println("Liste vide");
+ } else if (headNode.getNext() == null) {
+ System.out.println("Valeur du noeud 0 : " + headNode.getData());
+ } else {
+ IntNode nodeCursor = headNode;
+ int i = 0;
+ while (nodeCursor.getNext() != null) {
+ System.out.println("Valeur du noeud " + i + " : " + nodeCursor.getData());
+ nodeCursor = nodeCursor.getNext();
+ i++;
+ }
+ System.out.println("Valeur du noeud " + i++ + " : " + nodeCursor.getData());
+ }
+ }
+
+ public static void main(String[] args) {
+ Liste LinkedList = new Liste();
+
+ LinkedList.inserer(2);
+ LinkedList.inserer(1);
+ LinkedList.inserer(4);
+ LinkedList.afficher();
+ System.out.println("Taille de la liste : " + LinkedList.getSize());
+
+ LinkedList.inserer(2);
+ LinkedList.inserer(10);
+ LinkedList.inserer(0);
+ LinkedList.afficher();
+ System.out.println("Taille de la liste : " + LinkedList.getSize());