链表-E-实现队列
来源:互联网 发布:pythonpath linux 编辑:程序博客网 时间:2024/06/05 17:59
package e_link.E_queue;
public class FirstLastList {
private Link first;
private Link last;
public FirstLastList() {
first = null;
last = null;
}
public boolean isEmpty() {
return first == null;
}
public void insertLast(long dd) {
Link newLink = new Link(dd);
if (isEmpty())
first = newLink;
else
last.next = newLink;
last = newLink;
}
public long deleteFirst() {
long temp = first.data;
if (first.next == null)
last = null;
first = first.next;
return temp;
}
public void displayList() {
Link current = first;
while (current != null) {
current.displayLink();
current = current.next;
}
}
}package e_link.E_queue;
public class Link {
public long data;
public Link next;
public Link(long d) {
data = d;
}
public void displayLink() {
System.out.println(data);
}
}package e_link.E_queue;
public class LinkQueue {
private FirstLastList theList;
public LinkQueue() {
theList = new FirstLastList();
}
public boolean isEmpty() {
return theList.isEmpty();
}
public void insert(long dd) {
theList.insertLast(dd);
}
public long remove() {
return theList.deleteFirst();
}
public void displayQueue() {
theList.displayList();
}
}package e_link.E_queue;
/**
* 链表实现队列
*
* @author Administrator
*
*/
public class LinkQueueApp {
public static void main(String[] args) {
LinkQueue linkQueue = new LinkQueue();
linkQueue.insert(10);
linkQueue.insert(20);
linkQueue.insert(30);
linkQueue.displayQueue();
linkQueue.insert(40);
linkQueue.insert(50);
linkQueue.insert(60);
System.out.println("-------------");
linkQueue.displayQueue();
linkQueue.remove();
linkQueue.remove();
linkQueue.remove();
linkQueue.remove();
System.out.println("-------------");
linkQueue.displayQueue();
}
}
public class FirstLastList {
private Link first;
private Link last;
public FirstLastList() {
first = null;
last = null;
}
public boolean isEmpty() {
return first == null;
}
public void insertLast(long dd) {
Link newLink = new Link(dd);
if (isEmpty())
first = newLink;
else
last.next = newLink;
last = newLink;
}
public long deleteFirst() {
long temp = first.data;
if (first.next == null)
last = null;
first = first.next;
return temp;
}
public void displayList() {
Link current = first;
while (current != null) {
current.displayLink();
current = current.next;
}
}
}package e_link.E_queue;
public class Link {
public long data;
public Link next;
public Link(long d) {
data = d;
}
public void displayLink() {
System.out.println(data);
}
}package e_link.E_queue;
public class LinkQueue {
private FirstLastList theList;
public LinkQueue() {
theList = new FirstLastList();
}
public boolean isEmpty() {
return theList.isEmpty();
}
public void insert(long dd) {
theList.insertLast(dd);
}
public long remove() {
return theList.deleteFirst();
}
public void displayQueue() {
theList.displayList();
}
}package e_link.E_queue;
/**
* 链表实现队列
*
* @author Administrator
*
*/
public class LinkQueueApp {
public static void main(String[] args) {
LinkQueue linkQueue = new LinkQueue();
linkQueue.insert(10);
linkQueue.insert(20);
linkQueue.insert(30);
linkQueue.displayQueue();
linkQueue.insert(40);
linkQueue.insert(50);
linkQueue.insert(60);
System.out.println("-------------");
linkQueue.displayQueue();
linkQueue.remove();
linkQueue.remove();
linkQueue.remove();
linkQueue.remove();
System.out.println("-------------");
linkQueue.displayQueue();
}
}
0 0
- 链表-E-实现队列
- E - 队列的操作
- E Card Trick(队列)
- CF 899E Segments Removal 链表+优先队列
- 不可变队列ImmuableQueue<E>
- 507E (Dijkstra+优先队列)
- java 优先队列 PriorityQueue<E>
- Codeforces 767E 优先队列
- 队列的实现(FIFO、链表)
- 约瑟夫问题-链表+队列实现
- 队列另一种实现(链表)
- Java实现栈\队列\链表
- 队列实现
- 队列实现
- 队列实现
- 队列实现
- 队列实现
- 队列实现
- 链表-C-双端链表
- 关于编程、重构等 42条建议 下
- mysql主从复制
- 链表-D-链表实现栈
- Backbone.js中的Events模块如何使用?
- 链表-E-实现队列
- 计算机操作系统知识图谱
- 数论(多个数gcd) CodeForces757B Bash's Big Day
- CentOS 7下MySQL 5.7安装、配置与应用
- 226. Invert Binary Tree
- 链表-F-有序链表
- 链表-G- 利用有序链表给数组排序
- Unity3d调用Anroid(Android Studio环境)方法
- Javascript如何实现二分查找?