算法思想:
方法一:采用链表的方式实现对列
方法二:采用数组的方式实现队列
方法一代码如下:
package com.haobi;
/*
* 链表方式实现队列
*/
class Node<E>{
Node<E> next = null;
E data;
public Node(E data) {
this.data = data;
}
}
public class MyQueue<E> {
private Node<E> head = null;
private Node<E> tail = null;
public boolean isEmpty() {
return head == tail;
}
public void put(E data) {
Node<E> newNode = new Node<E>(data);
if(head == null && tail == null) {//队列为空
head = tail = newNode;
}else {//队列不为空,在队尾插入元素
tail.next = newNode;
tail = newNode;
}
}
public E pop() {
if(this.isEmpty())
return null;
E data = head.data;
head = head.next;
return data;
}
public int size() {
Node<E> tmp = head;
int n = 0;
while(tmp != null) {
n++;
tmp = tmp.next;
}
return n;
}
public static void main(String[] args) {
MyQueue<Integer> q = new MyQueue<Integer>();
q.put(2);
q.put(1);
q.put(3);
System.out.println("队列长度:"+q.size());
System.out.println("队首元素:"+q.pop());
}
}
程序输出结果如下:
队列长度:3
队首元素:2
方法二代码如下:
package com.haobi;
/*
* 数组实现队列(为了实现多线程安全,增加了对队列操作的同步)
*/
import java.util.LinkedList;
public class MyQueue1<E> {
private LinkedList<E> list = new LinkedList<E>();
private int size = 0;
public synchronized void put(E e) {
list.addLast(e);
size++;
}
public synchronized E pop() {
size--;
return list.removeFirst();
}
public synchronized boolean empty() {
return size == 0;
}
public synchronized int size() {
return size;
}
public static void main(String[] args) {
MyQueue1<Integer> q = new MyQueue1<Integer>();
q.put(3);
q.put(1);
q.put(2);
System.out.println("队列长度:"+q.size());
System.out.println("队首元素:"+q.pop());
}
}
程序输出结果如下:
队列长度:3
队首元素:3