添加双端链表和双向链表

chenweijie · chenweijie · commit f573aa94a696 · 2019-03-14T00:16:40.000+08:00
diff --git a/src/main/java/com/chen/dataStructure/linknode/DoublePointLinkedList.java b/src/main/java/com/chen/dataStructure/linknode/DoublePointLinkedList.java
@@ -0,0 +1,148 @@
+package com.chen.dataStructure.linknode;
+
+/**
+ * &#21452;&#31471;&#38431;&#21015;
+ *
+ * @author :  chen weijie
+ * @Date: 2019-03-13 11:12 PM
+ */
+public class DoublePointLinkedList {
+
+
+    private Node head;
+
+    private Node tail;
+
+    private int size;
+
+
+    private class Node {
+
+        private Object data;
+
+        private Node next;
+
+        public Node(Object data) {
+            this.data = data;
+        }
+    }
+
+
+    public DoublePointLinkedList() {
+        this.head = null;
+        this.tail = null;
+        this.size = 0;
+    }
+
+
+    /**
+     * &#22836;&#37096;&#28155;&#21152;&#33410;&#28857;
+     *
+     * @param data
+     */
+    public void addHead(Object data) {
+
+        Node node = new Node(data);
+
+        //&#22914;&#26524;&#38142;&#34920;&#20026;&#31354;&#65292;&#37027;&#20040;&#22836;&#33410;&#28857;&#21644;&#23614;&#33410;&#28857;&#37117;&#26159;&#35813;&#26032;&#22686;&#33410;&#28857;
+        if (size == 0) {
+            size = 0;
+            head = node;
+            tail = node;
+        } else {
+            node.next = head;
+            head = node;
+            size++;
+        }
+    }
+
+
+    public void addTail(Object data) {
+
+        Node node = new Node(data);
+
+        //&#22914;&#26524;&#38142;&#34920;&#20026;&#31354;&#65292;&#37027;&#20040;&#22836;&#33410;&#28857;&#21644;&#23614;&#33410;&#28857;&#37117;&#26159;&#35813;&#26032;&#22686;&#33410;&#28857;
+        if (size == 0) {
+            size = 0;
+            head = node;
+            tail = node;
+        } else {
+            node.next = tail;
+            tail = node;
+            size++;
+        }
+
+    }
+
+
+    /**
+     * &#21024;&#38500;&#22836;&#33410;&#28857;
+     *
+     * @return
+     */
+    public boolean deleteHead() {
+
+        if (size == 0) {
+            return false;
+        }
+
+        if (head.next == null) {
+            head = null;
+            tail = null;
+        } else {
+            head = head.next;
+        }
+        size--;
+        return true;
+    }
+
+
+    /**
+     * &#21028;&#26029;&#26159;&#21542;&#20026;&#31354;
+     *
+     * @return
+     */
+    public boolean isEmpty() {
+        return (size == 0);
+    }
+
+    /**
+     * &#33719;&#24471;&#38142;&#34920;&#30340;&#33410;&#28857;&#20010;&#25968;
+     *
+     * @return
+     */
+    public int getSize() {
+        return size;
+    }
+
+    /**
+     * &#26174;&#31034;&#33410;&#28857;&#20449;&#24687;
+     */
+
+    public void display() {
+        if (size > 0) {
+            Node node = head;
+            int tempSize = size;
+            if (tempSize == 1) {//&#24403;&#21069;&#38142;&#34920;&#21482;&#26377;&#19968;&#20010;&#33410;&#28857;
+                System.out.println("[" + node.data + "]");
+                return;
+            }
+            while (tempSize > 0) {
+                if (node.equals(head)) {
+                    System.out.print("[" + node.data + "->");
+                } else if (node.next == null) {
+                    System.out.print(node.data + "]");
+                } else {
+                    System.out.print(node.data + "->");
+                }
+                node = node.next;
+                tempSize--;
+            }
+            System.out.println();
+        } else {//&#22914;&#26524;&#38142;&#34920;&#19968;&#20010;&#33410;&#28857;&#37117;&#27809;&#26377;&#65292;&#30452;&#25509;&#25171;&#21360;[]
+            System.out.println("[]");
+        }
+    }
+
+
+}
diff --git a/src/main/java/com/chen/dataStructure/linknode/TwoWayLinkedList.java b/src/main/java/com/chen/dataStructure/linknode/TwoWayLinkedList.java
@@ -0,0 +1,95 @@
+package com.chen.dataStructure.linknode;
+
+/**
+ * &#21452;&#21521;&#38142;&#34920;
+ *
+ * @author :  chen weijie
+ * @Date: 2019-03-13 11:49 PM
+ */
+public class TwoWayLinkedList {
+
+
+    private int size;
+
+    private Node head;
+
+    private Node tail;
+
+
+    public class Node {
+
+        private Object data;
+
+        private Node next;
+
+        private Node prew;
+
+
+        public Node(Object data) {
+            this.data = data;
+        }
+    }
+
+
+    public TwoWayLinkedList() {
+        this.size = 0;
+        this.head = null;
+        this.tail = null;
+    }
+
+
+    public void addHead(Object data) {
+
+        Node node = new Node(data);
+        if (size == 0) {
+            head = node;
+            tail = node;
+        } else {
+            head.prew = node;
+            node.next = head;
+            head = node;
+        }
+
+        size++;
+    }
+
+
+    public void addTail(Object data) {
+
+        Node node = new Node(data);
+        if (size == 0) {
+            head = node;
+            tail = node;
+        } else {
+            node.prew = tail;
+            tail.next = node;
+            tail = node;
+        }
+        size++;
+    }
+
+
+    public Node deleteHead() {
+
+        Node temp = head;
+        if (size > 0) {
+            head = head.next;
+            head.prew = null;
+            size--;
+        }
+        return temp;
+    }
+
+    public Node deleteTail() {
+
+        Node temp = tail;
+        if (size > 0) {
+            tail = head.prew;
+            tail.next = null;
+            size--;
+        }
+        return temp;
+    }
+
+
+}
