从链表开始遍历打印链表

chenweijie · chenweijie · commit edaf077bf2bb · 2019-02-22T01:40:46.000+08:00
diff --git a/src/main/java/com/chen/algorithm/exercise/ArraySearch.java b/src/main/java/com/chen/algorithm/exercise/ArraySearch.java
@@ -1,8 +1,6 @@
 package com.chen.algorithm.exercise;
 
 
-
-
 /**
  * 二维数组是有序的：从右上角来看，从左向右依次递减；向下数字递增；
  * <p>
@@ -11,6 +9,7 @@
  * 当要查找的数字比右上角的数字小时，左移；
  * 如果出了边界，则说明二维数组中不存在该整数。
  */
+
 /**
  * @author :  chen weijie
  * @Date: 2019-02-20 12:53 AM
diff --git a/src/main/java/com/chen/algorithm/exercise/PrintLinkList.java b/src/main/java/com/chen/algorithm/exercise/PrintLinkList.java
@@ -0,0 +1,57 @@
+package com.chen.algorithm.exercise;
+
+import java.util.ArrayList;
+
+/**
+ * 输入一个链表，按链表值从尾到头的顺序返回一个ArrayList。
+ *
+ * @author :  chen weijie
+ * @Date: 2019-02-21 11:21 PM
+ * <p>
+ * 一种方法是利用栈来实现；
+ * 另外一种方法是利用三个指针把链表反转，关键是 r 指针保存断开的节点。
+ */
+public class PrintLinkList {
+
+    public class ListNode {
+        int val;
+        ListNode next = null;
+
+        ListNode(int val) {
+            this.val = val;
+        }
+    }
+
+    public class Solution {
+
+        public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
+            if (listNode == null) {
+                return new ArrayList<>();
+            }
+
+            //使用三个指针反转，
+            ListNode head = listNode;
+            ListNode curr = listNode.next;
+            ListNode temp;
+            while (curr != null) {
+                temp = curr.next;
+                curr.next = head;
+                head = curr;
+                curr = temp;
+            }
+            listNode.next = null;
+
+            //遍历
+            ArrayList<Integer> res = new ArrayList<Integer>();
+            while (head != null) {
+                res.add(head.val);
+                head = head.next;
+            }
+            return res;
+
+
+        }
+    }
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/linklistnode/SingleLinkedList.java b/src/main/java/com/chen/dataStructure/linklistnode/SingleLinkedList.java
@@ -0,0 +1,129 @@
+package com.chen.dataStructure.linklistnode;
+
+/**
+ * 单链表的具体实现
+ * @author :  chen weijie
+ * @Date: 2019-02-21 11:35 PM
+ */
+public class SingleLinkedList {
+
+    //链表节点的个数
+    private int size;
+
+    //头节点
+    private Node head;
+
+
+
+    private class Node {
+
+        //每个节点的数据
+        private Object data;
+
+        //每个节点指向下一个节点的连接
+        private Node next;
+
+        public Node(Object data) {
+            this.data = data;
+        }
+    }
+
+
+    /**
+     * 单链表的表头添加元素
+     * @param data
+     * @return
+     */
+    public Object addHead(Object data) {
+
+        Node newHead = new Node(data);
+
+        if (size == 0) {
+            head = newHead;
+        } else {
+            //新头节点的下个节点是旧的head节点
+            newHead.next = head;
+            //新加入的节点为SingleLinkedList的头节点
+            head = newHead;
+        }
+
+        size++;
+        return data;
+    }
+
+
+    /**
+     * 删除链表头节点
+     * @return
+     */
+    public Object deleteHead() {
+
+        Object data = head.data;
+
+        //新头节点为旧头节点的下个节点
+        head = head.next;
+
+        size--;
+        return data;
+    }
+
+    /**
+     * 找到指定元素返回节点Node，找不到返回null
+     *
+     * @param data
+     * @return
+     */
+    public Node find(Object data) {
+
+        Node curr = head;
+        //只是查找，不改变链表的个数，所以要新建tempSize变量
+        int tempSize = size;
+
+        while (tempSize > 0) {
+            if (data.equals(curr.data)) {
+                return curr;
+            }
+            curr = curr.next;
+            tempSize--;
+        }
+        return null;
+    }
+
+    /**
+     * 删除指定元素，删除成功返回true
+     * @param data
+     * @return
+     */
+    public boolean delete(Object data){
+
+
+
+
+
+
+
+
+
+
+        return false;
+    }
+
+
+    /**
+     * 判断链表是不是空
+     *
+     * @return
+     */
+    public boolean isEmpty() {
+        return size == 0;
+    }
+
+
+
+
+
+
+
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/linknode/LinkNodeTest.java b/src/main/java/com/chen/dataStructure/linknode/LinkNodeTest.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure;
+package com.chen.dataStructure.linknode;
 
 /**
  * http://blog.csdn.net/guyuealian/article/details/51119499(单链表的反转)
diff --git a/src/main/java/com/chen/dataStructure/linknode/Node.java b/src/main/java/com/chen/dataStructure/linknode/Node.java
@@ -1,4 +1,4 @@
-package com.chen.dataStructure;
+package com.chen.dataStructure.linknode;
 
 /**
  * @Author chenweijie

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.dataStructure;`
	`1`	`+package com.chen.dataStructure.linknode;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* http://blog.csdn.net/guyuealian/article/details/51119499(单链表的反转)`