输入个链表的头结点，从尾到头反过来打印出每个结点的值

randian666 · randian666 · commit bec0196387b8 · 2018-12-15T00:23:26.000+08:00
diff --git a/src/main/java/com/algorithm/study/demo/algorithm/Jianzhi02.java b/src/main/java/com/algorithm/study/demo/algorithm/Jianzhi02.java
@@ -1,5 +1,7 @@
 package com.algorithm.study.demo.algorithm;
 
+import java.util.LinkedList;
+import java.util.List;
 import java.util.Stack;
 
 /**
@@ -21,11 +23,28 @@ public ListNode(int e, ListNode next){
     }
     private  int size=0;// 保存已含有的节点数
     private  ListNode root;
+    private  ListNode last;
     public  void addFirst(int e){
-        root=new ListNode(e,root);
+        ListNode first=root;
+        ListNode listNode=new ListNode(e,null);
+        root=listNode;
+        if (first==null){
+            last=listNode;
+        }
+        size++;
+    }
+    public  void add(int e){
+        ListNode temp=last;
+        if (temp==null){
+            addFirst(e);
+            return;
+        }else{
+            ListNode node =new ListNode(e,null);
+            temp.next=node;
+            last=node;
+        }
         size++;
     }
-
     /**
      * 从尾到头反过来打印出每个结点的值
      */
@@ -46,11 +65,13 @@ public void printListInverselyUsingIteration() {
 
         public static void main(String[] args) {
         Jianzhi02 listnode=new Jianzhi02();
-        listnode.addFirst(4);
-        listnode.addFirst(3);
-        listnode.addFirst(2);
-        listnode.addFirst(1);
+        listnode.add(4);
+        listnode.add(3);
+        listnode.add(2);
+        listnode.add(1);
         listnode.printListInverselyUsingIteration();
+        LinkedList linkedList=new LinkedList();
+        linkedList.add(1);
 
     }
 }
