src/main/java/com/nbee/solution/practice/SinglyLinkedList.java

@@ -1,52 +1,12 @@
 package com.nbee.solution.practice;
 
-import java.util.Iterator;
 import java.util.function.Consumer;
 
 /**
  * 链表类
  */
-public class SinglyLinkedList implements Iterable<Integer> {
+public class SinglyLinkedList {
     private Node head;
-
-    @Override
-    public Iterator<Integer> iterator() {
-        return new Iterator<Integer>() {
-            Node p = head;
-
-            @Override
-            public boolean hasNext() {
-                return p != null;
-            }
-
-            @Override
-            public Integer next() {
-                int value = p.value;
-                p = p.next;
-                return value;
-            }
-        };
-    }
-
-    private Node findLast() {
-        if (head == null) {
-            return null;
-        }
-        Node p;
-        for (p = head; p != null; p = p.next) {
-        }
-        return p;
-    }
-
-    public void addLast(int value) {
-        Node last = findLast();
-        if (last == null){
-            addFirst(value);
-            return;
-        }
-        last.next = new Node(value, null);
-    }
-
     private static class Node {
         int value;
         Node next;
@@ -56,14 +16,12 @@ public class SinglyLinkedList implements Iterable<Integer> {
             this.next = next;
         }
     }
-
     public void addFirst(int value) {
         //链表为空
 //        head = new Node(value,null);
         //链表非空，包含了链表为空的情况
-        head = new Node(value, head);
+        head = new Node(value,head);
     }
-
     public void loop(Consumer<Integer> consumer) {
         Node p = head;
         while (p != null) {
@@ -72,7 +30,7 @@ public class SinglyLinkedList implements Iterable<Integer> {
         }
     }
     
-    public void loop0(Consumer<Integer> consumer) {
+    public void loop0 (Consumer<Integer> consumer){
         for (Node p = head; p != null; p = p.next) {
             consumer.accept(p.value);
         }

src/test/java/com/nbee/solution/practice/SinglyLinkedListTest.java

@@ -12,14 +12,4 @@ public class SinglyLinkedListTest {
         list.addFirst(6);
         list.loop0(i -> System.out.println(i + " "));
     }
-    @Test
-    public void singlyLinkedListIteratorTest(){
-        list.addFirst(1);
-        list.addFirst(3);
-        list.addFirst(5);
-        list.addFirst(6);
-        for (Integer value: list) {
-            System.out.println(value);
-        }
-    }
 }