diff --git a/ArrayStack.java b/ArrayStack.java
new file mode 100644
index 0000000000000000000000000000000000000000..e321bc6dfd7b0b381501b1ddaed980688816e738
--- /dev/null
+++ b/ArrayStack.java
@@ -0,0 +1,66 @@
+package zhan;
+
+public class ArrayStack {
+    private long[] a;
+    private int size;//栈数组的大小
+    private int top;//栈顶
+
+    public ArrayStack(int maxSize) {
+        this.size = maxSize;
+        this.a = new long[size];
+        this.top = -1;//表示空栈
+    }
+
+    //入栈
+    public void push(long value){
+        if(isFull()){
+            System.out.println("栈已经满！");
+            return;
+        }
+        a[++top] = value;
+    }
+
+    //返回栈顶内容，但是不删除
+    public void peek(){
+        if(isEmpty()){
+            System.out.println("栈中没有数据！");
+        }
+        System.out.println(a[top]);
+    }
+
+    //弹出栈顶内容，删除
+    public long pop(){
+        if(isEmpty()){
+            System.out.println("栈中没有数据！");
+            return 0;
+        }
+        return a[top--];
+    }
+
+    //size栈的大小
+    public int size(){
+        return top + 1;
+    }
+
+    //是否为空
+    public boolean isEmpty() {
+        return (top == -1);
+    }
+
+    //是否满了
+    public boolean isFull() {
+        return (top == size - 1);
+    }
+
+    //显示
+    public void display(){
+        System.out.print("[");
+        for (int i = top; i >=0 ; i--) {
+            System.out.print(a[i]);
+            if(i!=0){
+                System.out.print(",");
+            }
+        }
+        System.out.println("]");
+    }
+}
diff --git a/LinkQueue.java b/LinkQueue.java
new file mode 100644
index 0000000000000000000000000000000000000000..469a7bedf9b1cabc3dad318e8abd3f72da6f7259
--- /dev/null
+++ b/LinkQueue.java
@@ -0,0 +1,81 @@
+package zhan;
+
+public class LinkQueue<T>
+{
+    class Node<T>
+    {
+        private T data;//数据域
+        private Node<T> next;//引用域
+        public Node()
+        {
+            this.data=null;
+            this.next=null;
+        }
+        public Node(T data)
+        {
+            this.data=data;
+            this.next=null;
+        }
+        public void setNext(Node<T> t)
+        {
+            this.next=t;
+        }
+        public T getData()
+        {
+            return this.data;
+        }
+        public Node<T> getNext()
+        {
+            return this.next;
+        }
+    }
+    private Node<T> head;//队头
+    private Node<T> tail;//队尾
+    public LinkQueue()
+    {
+        this.head=null;
+        this.tail=null;
+    }
+    //入队
+    public boolean inQueue(T t)
+    {
+        Node<T> p=new Node<T>(t);//生成一个结点
+        if(head==null)//如果头等于空
+        {
+            head=p;//头引用指向这个结点
+            tail=p;//尾引用指向这个结点
+        }
+        else
+        {
+            tail.next=p;//插入尾部
+            tail=p;//尾引用指向新的尾结点
+        }
+        return true;
+    }
+    //dream it possible
+    //出队
+    public T outQueue()
+    {
+        if(head==null) return null;
+        else
+        {
+            T t=head.getData();//取下对队头
+            head=head.next;//头引用后移
+            return t;
+        }
+
+    }
+    //查队头
+    public T peek()
+    {
+        if(head==null) return null;
+        else
+            return head.getData();
+    }
+    //判空
+    public boolean isEmpty()
+    {
+        return head==null;
+    }
+
+}
diff --git a/QueueTest.java b/QueueTest.java
new file mode 100644
index 0000000000000000000000000000000000000000..7a7f0e101356fa05ff077534c1c0b983be450a29
--- /dev/null
+++ b/QueueTest.java
@@ -0,0 +1,78 @@
+package zhan;
+
+public class QueueTest {
+    public static void main(String[] args) {
+        ArrayQueue queue = new ArrayQueue(10);
+        System.out.println(queue.isEmpty());
+        for (int i = 0; i < 10; i++) {
+            queue.insert(i);
+        }
+        System.out.println(queue.isFull());
+        while (!queue.isEmpty()) {
+            System.out.println(queue.remove());
+        }
+    }
+}
+class ArrayQueue {
+    private int[] arrInt;// 内置数组
+    private int front;// 头指针
+    private int rear;// 尾指针
+    public ArrayQueue(int size) {
+        this.arrInt = new int[size];
+        front = 0;
+        rear = -1;
+    }
+    /**
+     * 判断队列是否为空
+     *
+     * @return
+     */
+    public boolean isEmpty() {
+        return front == arrInt.length;
+    }
+    /**
+     * 判断队列是否已满
+     *
+     * @return
+     */
+    public boolean isFull() {
+        return arrInt.length - 1 == rear;
+    }
+    /**
+     * 向队列的队尾插入一个元素
+     */
+    public void insert(int item) {
+        if (isFull()) {
+            throw new RuntimeException("队列已满");
+        }
+        arrInt[++rear] = item;
+    }
+    /**
+     * 获得对头元素
+     *
+     * @return
+     */
+    public int peekFront() {
+        return arrInt[front];
+    }
+    /**
+     * 获得队尾元素
+     *
+     * @return
+     */
+    public int peekRear() {
+        return arrInt[rear];
+    }
+    /**
+     * 从队列的对头移除一个元素
+     *
+     * @return
+     */
+    public int remove() {
+        if (isEmpty()) {
+            throw new RuntimeException("队列为空");
+        }
+        return arrInt[front++];
+    }
+
+}