Add ordered simply linked list exercice code.

Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>

diff --git a/Listes/Liste.java b/Listes/Liste.java
index d290a9cc4154716b753a2287b3991a4561cdf198..6a62aea93ac02feeaba37c34db1421ae8a06750e 100644 (file)
--- a/Listes/Liste.java
+++ b/Listes/Liste.java
@@ -1,23 +1,171 @@
 
-class Liste {
+
+class IntNode {
     private int data;
+    private IntNode next;
+
+    IntNode(int value) {
+        setData(value);
+        setNext(null);
+    }
+
+    IntNode(int value, IntNode nextNode) {
+        setData(value);
+        setNext(nextNode);
+    }
+
+    public int getData() {
+        return data;
+    }
+
+    public void setData(int value) {
+        data = value;
+    }
+
+    public IntNode getNext() {
+        return next;
+    }
+
+    public void setNext(IntNode nextNode) {
+        next = nextNode;
+    }
+
+}
+
+class Liste {
+    private IntNode headNode;
     private int list_counter;
-    private Liste next;
 
     Liste() {
+        setheadNode(null);
+        setSize(0);
+    }
 
+    private boolean isEmpty()
+    {
+        return headNode == null;
     }
 
     private int getSize() {
         return list_counter;
     }
 
-    public boolean inserer(int value) {
+    private void setSize(int size) {
+        list_counter = size;
+    }
+
+    private void setheadNode(IntNode node) {
+        headNode = node;
+    }
 
+    private IntNode getheadNode() {
+        return headNode;
+    }
+
+    public void inserer(int value) {
+        boolean inserted = false;
+        if (isEmpty()) {
+            headNode = new IntNode(value);
+            list_counter++;
+            return;
+        } else if (value < headNode.getData()) {
+            headNode = new IntNode(value, headNode);
+            list_counter++;
+            return;
+        } else {
+            IntNode nodeCursor = headNode;
+            IntNode nodeCursorNext = headNode.getNext();
+            while (nodeCursorNext != null) {
+                if (value == nodeCursor.getData() || value == nodeCursorNext.getData()) {
+                    inserted = true;
+                    break;
+                } else if (value > nodeCursor.getData() && value < nodeCursorNext.getData()) {
+                    nodeCursor.setNext(new IntNode(value, nodeCursorNext));
+                    inserted = true;
+                    list_counter++;
+                    break;
+                } else {
+                    nodeCursor = nodeCursorNext;
+                    nodeCursorNext = nodeCursorNext.getNext();
+                }
+            }
+            if (!inserted) {
+                nodeCursor.setNext(new IntNode(value));
+                list_counter++;
+            }
+        }
     }
 
     public boolean supprimer(int value) {
+        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());
 
+        LinkedList.supprimer(4);
+        LinkedList.afficher();
+        System.out.println("Taille de la liste : " + LinkedList.getSize());
+        LinkedList.supprimer(0);
+        LinkedList.afficher();
+        System.out.println("Taille de la liste : " + LinkedList.getSize());
+        LinkedList.supprimer(0);
+        LinkedList.afficher();
+        System.out.println("Taille de la liste : " + LinkedList.getSize());
+        LinkedList.supprimer(10);
+        LinkedList.afficher();
+        System.out.println("Taille de la liste : " + LinkedList.getSize());
     }
 
 }