✨ 三种方式反向打印链表

crossoverJie · crossoverJie · commit 8c43814ff2aa · 2018-02-11T12:02:33.000+08:00
diff --git a/README.md b/README.md
@@ -53,6 +53,7 @@
 - [从一个数组中返回两个值相加等于目标值的下标](https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/algorithm/TwoSum.java#L38-L59)
 - [一致 Hash 算法](https://github.com/crossoverJie/Java-Interview/blob/master/MD/Consistent-Hash.md)
 - [限流算法](https://github.com/crossoverJie/Java-Interview/blob/master/MD/Limiting.md)
+- [三种方式反向打印单向链表](https://github.com/crossoverJie/Java-Interview/blob/master/MD/Limiting.md)
 
 ### 附加技能
 
diff --git a/src/main/java/com/crossoverjie/algorithm/ReverseNode.java b/src/main/java/com/crossoverjie/algorithm/ReverseNode.java
@@ -0,0 +1,104 @@
+package com.crossoverjie.algorithm;
+
+import java.util.Stack;
+
+/**
+ * Function: 三种方式反向打印单向链表
+ *
+ * @author crossoverJie
+ *         Date: 10/02/2018 16:14
+ * @since JDK 1.8
+ */
+public class ReverseNode {
+
+
+    /**
+     * 利用栈的先进后出特性
+     * @param node
+     */
+    public void reverseNode1(Node node){
+
+        System.out.println("====翻转之前====");
+
+        Stack<Node> stack = new Stack<>() ;
+        while (node != null){
+
+            System.out.print(node.value + "===>");
+
+            stack.push(node) ;
+            node = node.next ;
+        }
+
+        System.out.println("");
+
+        System.out.println("====翻转之后====");
+        while (!stack.isEmpty()){
+            System.out.print(stack.pop().value + "===>");
+        }
+
+    }
+
+
+    /**
+     * 利用头插法插入链表
+     * @param head
+     */
+    public  void reverseNode(Node head) {
+        if (head == null) {
+            return ;
+        }
+
+        Node node ;
+
+        Node pre = head;
+        Node cur = head.next;
+        Node next                                                                     ;
+        while(cur != null){
+            next = cur.next;
+
+            //链表的头插法
+            cur.next = pre;
+            pre = cur;
+
+            cur = next;
+        }
+        head.next = null;
+        node = pre;
+
+
+        while (node != null){
+            System.out.println(node.value);
+            node = node.next ;
+        }
+
+    }
+
+
+    /**
+     * 递归
+     * @param node
+     */
+    public void recNode(Node node){
+
+        if (node == null){
+            return ;
+        }
+
+        if (node.next != null){
+            recNode(node.next) ;
+        }
+        System.out.print(node.value+"===>");
+    }
+
+
+    public static class Node<T>{
+        public T value;
+        public Node<T> next ;
+
+
+        public Node(T value, Node<T> next ) {
+            this.next = next;
+            this.value = value;
+        }
+    }
+}
