EulerFormula
diff --git a/‎src/com/zejian/structures/LinkedList/MyCollection/MylinkeList.java‎
Lines changed: 5 additions & 5 deletions b/‎src/com/zejian/structures/LinkedList/MyCollection/MylinkeList.java‎
Lines changed: 5 additions & 5 deletions
diff --git a/‎src/com/zejian/structures/LinkedList/MyCollection/SortMyLinkedList.java‎
Lines changed: 88 additions & 0 deletions b/‎src/com/zejian/structures/LinkedList/MyCollection/SortMyLinkedList.java‎
Lines changed: 88 additions & 0 deletions
diff --git a/‎src/com/zejian/structures/LinkedList/doubleLinked/LoopHeadDILinkedList.java‎
Lines changed: 1 addition & 1 deletion b/‎src/com/zejian/structures/LinkedList/doubleLinked/LoopHeadDILinkedList.java‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/com/zejian/structures/LinkedList/doubleLinked/SortLoopHeadDIlinkedList.java‎
Lines changed: 1 addition & 0 deletions b/‎src/com/zejian/structures/LinkedList/doubleLinked/SortLoopHeadDIlinkedList.java‎
Lines changed: 1 addition & 0 deletions
diff --git a/‎src/com/zejian/structures/Queue/LinkedQueue.java‎
Lines changed: 150 additions & 0 deletions b/‎src/com/zejian/structures/Queue/LinkedQueue.java‎
Lines changed: 150 additions & 0 deletions
@@ -15,22 +15,22 @@ public class MylinkeList<T> implements Serializable,IList<T>, Iterable<T>{
     /**
      * 链表size,优化计算过程,无需遍历链表
      */
-    private int size = 0;
+    protected int size = 0;
 
     /**
      * 修改的记录符
      */
-    private int modCount=0;
+    protected int modCount=0;
 
     /**
      * 头部指向结点,不带数据,排除特殊情况,优化代码量
      */
-    private Node<T> first;
+    protected Node<T> first;
 
     /**
      * 尾部指向结点,不带数据,排除特殊情况,优化代码量
      */
-    private Node<T> last;
+    protected Node<T> last;
 
     /**
      * 初始化链表
@@ -501,7 +501,7 @@ final void checkForComodification() {
      * Blog : http://blog.csdn.net/javazejian
      * @param <T>
      */
-    private static class Node<T> {
+    protected static class Node<T> {
         T data;
         Node<T> next;
         Node<T> prev;
 
@@ -0,0 +1,88 @@
+package com.zejian.structures.LinkedList.MyCollection;
+
+import java.io.Serializable;
+import java.util.Iterator;
+import java.util.ListIterator;
+
+/**
+ * Created by zejian on 2016/12/3.
+ * Blog : http://blog.csdn.net/javazejian [原文地址,请尊重原创]
+ * 排序list的简单实现
+ */
+public class SortMyLinkedList<T extends Comparable<? extends T>> extends MylinkeList<T> implements Serializable {
+
+    private static final long serialVersionUID = -4783131709270334156L;
+
+    @Override
+    public boolean add(T data) {
+        if(data==null)
+            throw new NullPointerException("data can\'t be null");
+
+        Comparable cmp =data;//这里需要转一下类型,否则idea编辑器上检验不通过.
+
+        if(this.isEmpty() || cmp.compareTo(this.last.prev.data) > 0){
+             return super.add(data);//直接尾部添加,last不带数据的尾结点
+        }
+
+        Node<T> p=this.first.next;
+        //查找插入点
+        while (p!=null&&cmp.compareTo(p.data)>0)
+            p=p.next;
+
+        Node<T> q=new Node<>(p.prev,data,p);
+        p.prev.next=q;
+        p.prev=q;
+
+        size++;
+        //记录修改
+        modCount++;
+
+        return true;
+    }
+
+    /**
+     * 不根据下标插入,只根据比较大小插入
+     * @param index
+     * @param data
+     */
+    @Override
+    public void add(int index, T data) {
+        this.add(data);
+    }
+
+
+    /**
+     * 未实现
+     * @param index
+     * @return
+     */
+    @Override
+    public ListIterator<T> listIterator(int index) {
+        return null;
+    }
+
+    /**
+     * 未实现
+     * @return
+     */
+    @Override
+    public Iterator<T> iterator() {
+        return null;
+    }
+
+    //测试
+    public static void main(String[] args){
+        SortMyLinkedList<Integer> list=new SortMyLinkedList<>();
+        list.add(50);
+        list.add(40);
+        list.add(80);
+        list.add(20);
+        print(list);
+    }
+
+    public static void print(SortMyLinkedList mylinkeList){
+        for (int i=0;i<mylinkeList.size();i++) {
+            System.out.println("i->"+mylinkeList.get(i));
+        }
+    }
+}
@@ -8,7 +8,7 @@
  */
 public class LoopHeadDILinkedList<T> implements ILinkedList<T> {
 
-    protected DNode<T> head; //不带数据的头结点
+    public DNode<T> head; //不带数据的头结点
  //   protected DNode<T> tail; //指向尾部的指针
 
     public LoopHeadDILinkedList(){
 
@@ -36,6 +36,7 @@ public boolean add(T data) {
         return true;
     }
 
+
     public static void main(String[] args){
         SortLoopHeadDIlinkedList<Integer> list=new SortLoopHeadDIlinkedList<>();
         list.add(50);
 
@@ -0,0 +1,150 @@
+package com.zejian.structures.Queue;
+
+import com.zejian.structures.LinkedList.singleLinked.Node;
+
+import java.io.Serializable;
+import java.util.*;
+
+/**
+ * Created by zejian on 2016/11/28.
+ * Blog : http://blog.csdn.net/javazejian/article/details/53375004 [原文地址,请尊重原创]
+ * 链式队列的实现
+ */
+public class LinkedQueue<T> implements Queue<T> ,Serializable{
+    private static final long serialVersionUID = 1406881264853111039L;
+    /**
+     * 指向队头和队尾的结点
+     * front==null&&rear==null时,队列为空
+     */
+    private Node<T> front,rear;
+
+    private int size;
+    /**
+     * 用于控制最大容量,默认128,offer方法使用
+     */
+    private int maxSize=128;
+
+    public LinkedQueue(){
+        //初始化队列
+        this.front=this.rear=null;
+    }
+
+    @Override
+    public int size() {
+        return size;
+    }
+
+    public void setMaxSize(int maxSize){
+        this.maxSize=maxSize;
+    }
+
+    @Override
+    public boolean isEmpty() {
+        return front==null&&rear==null;
+    }
+
+    /**
+     * data 入队,添加成功返回true,否则返回false,可扩容
+     * @param data
+     * @return
+     */
+    @Override
+    public boolean add(T data) {
+        Node<T> q=new Node<>(data,null);
+        if (this.front==null) {//空队列插入
+            this.front = q;
+        } else {//非空队列,尾部插入
+            this.rear.next=q;
+        }
+        this.rear=q;
+        size++;
+        return true;
+    }
+
+    /**
+     * offer 方法可插入一个元素,这与add 方法不同，
+     * 该方法只能通过抛出未经检查的异常使添加元素失败。
+     * 而不是出现异常的情况，例如在容量固定（有界）的队列中
+     * NullPointerException:data==null时抛出
+     * IllegalArgumentException:队满,使用该方法可以使Queue的容量固定
+     * @param data
+     * @return
+     */
+    @Override
+    public boolean offer(T data) {
+        if (data==null)
+            throw new NullPointerException("The data can\'t be null");
+        if (size>=maxSize)
+            throw new IllegalArgumentException("The capacity of LinkedQueue has reached its maxSize:128");
+
+        Node<T> q=new Node<>(data,null);
+        if (this.front==null) {//空队列插入
+            this.front = q;
+        } else {//非空队列,尾部插入
+            this.rear.next=q;
+        }
+        this.rear=q;
+        size++;
+        return false;
+    }
+
+    /**
+     * 返回队头元素,不执行删除操作,若队列为空,返回null
+     * @return
+     */
+    @Override
+    public T peek() {
+        return this.isEmpty()? null:this.front.data;
+    }
+
+    /**
+     * 返回队头元素,不执行删除操作,若队列为空,抛出异常:NoSuchElementException
+     * @return
+     */
+    @Override
+    public T element() {
+        if(isEmpty()){
+            throw new NoSuchElementException("The LinkedQueue is empty");
+        }
+        return this.front.data;
+    }
+
+    /**
+     * 出队,执行删除操作,返回队头元素,若队列为空,返回null
+     * @return
+     */
+    @Override
+    public T poll() {
+        if (this.isEmpty())
+            return null;
+        T x=this.front.data;
+        this.front=this.front.next;
+        if (this.front==null)
+            this.rear=null;
+        size--;
+        return x;
+    }
+    
+    /**
+     * 出队,执行删除操作,若队列为空,抛出异常:NoSuchElementException
+     * @return
+     */
+    @Override
+    public T remove() {
+        if (isEmpty()){
+            throw new NoSuchElementException("The LinkedQueue is empty");
+        }
+        T x=this.front.data;
+        this.front=this.front.next;
+        if (this.front==null)
+            this.rear=null;
+        size--;
+        return x;
+    }
+
+    @Override
+    public void clearQueue() {
+        this.front= this.rear=null;
+        size=0;
+    }
+}
Original file line number	Diff line number	Diff line change
`@@ -36,6 +36,7 @@ public boolean add(T data) {`
`36`	`36`	`return true;`
`37`	`37`	`}`
`38`	`38`
	`39`	`+`
`39`	`40`	`public static void main(String[] args){`
`40`	`41`	`SortLoopHeadDIlinkedList<Integer> list=new SortLoopHeadDIlinkedList<>();`
`41`	`42`	`list.add(50);`