链表-L-循环链表
来源:互联网 发布:sql if else语句格式 编辑:程序博客网 时间:2024/06/04 19:00
package e_link.K_CircularLinkedList;
public class CList {
Link current;
FirstLastLink fll;
public CList() {
fll = new FirstLastLink();
reset();
}
public void insert(int k) {
fll.insertFirst(k);
reset();
}
public void reset() {
current = fll.getFirst();
}
public Link step() {
current = current.next;
return current;
}
}package e_link.K_CircularLinkedList;
/**
* 循环链表
*
* @author Administrator
*
*/
public class FirstLastLink {
private Link first;
private Link last;
public FirstLastLink() {
first = null;
last = null;
}
public Link getFirst() {
return first;
}
public Link getLast() {
return last;
}
public void insertFirst(int iData) {
Link newLink = new Link(iData);
if (isEmpty()) {
last = newLink;
}
newLink.next = first;
first = newLink;
}
public void insertLast(int iData) {
Link newLink = new Link(iData);
if (isEmpty()) {
first = newLink;
} else {
last.next = newLink;
}
// 循环链表
newLink.next = first;
last = newLink;
}
public int deleteFirst() {
int temp = first.iData;
if (first.next == null)
last = null;
first = first.next;
return temp;
}
public void displayLink() {
Link current = first;
while (current != null) {
current.display();
current = current.next;
}
}
public boolean isEmpty() {
return first == null;
}
}package e_link.K_CircularLinkedList;
public class Link {
public int iData;
public Link next;
public Link(int iData) {
this.iData = iData;
}
public void display() {
System.out.print(iData + " ");
}
}
public class CList {
Link current;
FirstLastLink fll;
public CList() {
fll = new FirstLastLink();
reset();
}
public void insert(int k) {
fll.insertFirst(k);
reset();
}
public void reset() {
current = fll.getFirst();
}
public Link step() {
current = current.next;
return current;
}
}package e_link.K_CircularLinkedList;
/**
* 循环链表
*
* @author Administrator
*
*/
public class FirstLastLink {
private Link first;
private Link last;
public FirstLastLink() {
first = null;
last = null;
}
public Link getFirst() {
return first;
}
public Link getLast() {
return last;
}
public void insertFirst(int iData) {
Link newLink = new Link(iData);
if (isEmpty()) {
last = newLink;
}
newLink.next = first;
first = newLink;
}
public void insertLast(int iData) {
Link newLink = new Link(iData);
if (isEmpty()) {
first = newLink;
} else {
last.next = newLink;
}
// 循环链表
newLink.next = first;
last = newLink;
}
public int deleteFirst() {
int temp = first.iData;
if (first.next == null)
last = null;
first = first.next;
return temp;
}
public void displayLink() {
Link current = first;
while (current != null) {
current.display();
current = current.next;
}
}
public boolean isEmpty() {
return first == null;
}
}package e_link.K_CircularLinkedList;
public class Link {
public int iData;
public Link next;
public Link(int iData) {
this.iData = iData;
}
public void display() {
System.out.print(iData + " ");
}
}
0 0
- 链表-L-循环链表
- 将双向循环链表L=(a1,a2,...,an)改造成L=(a1,a3,...,an,...,a4,a2)
- 判断带头结点的双向循环链表L是否对称相等的算法
- 2.14-实现Length(L)返回链表L的长度
- l链表的数据类型
- 设以带头结点的双向循环链表表示的线性表L= (a1,a2,…,an),试写一时间复杂度O(n)的算法,将L改造为 (a1,a3,…,an,…,a4,a2)。
- 链表::循环链表
- 链表--循环链表
- 设以带头结点的双向循环链表表示的线性表L=(a1,a2,……,an)。
- l链表的综合操作
- L - Alternating Current -链表贪心
- l链表的头插法和尾插法
- 链表::删除循环链表
- 链表::循环链 表插入
- 链表::建立循环链表
- C#链表;循环链表
- 进程l链
- l
- 链表-j-优先级队列,单向链表实现
- Python-opencv学习
- 链表-K-链表实现 双端队列
- Python学习之日志模块详解
- Windows Server2003本地用户的批量导入和导出
- 链表-L-循环链表
- 基于机器学习的网络异常流量识别系统——工具篇
- 504. Base 7
- SpringMVC入门之六:使用Thymeleaf作为视图
- 指针和引用的区别
- 链表-M-Josephus
- 历届试题 兰顿蚂蚁
- 使用Nginx的X-Sendfile机制提升PHP文件下载性能
- Lua与.net的CLR相互调用