一、链表的概念
1.链表是以节点的方式存储的,链式存储
2.每个节点包含data域(自身的数值)和next域(指向下个节点的位置)
3.每个节点不一定是连续的
4.链表分带头节点的链表和不带头节点的链表
二、代码实现
1.定义节点
// 定义节点
class Data02 {
public int id;
public String name;
public Data02 next;
public Data02() {
super();
}
public Data02(int id, String name) {
super();
this.id = id;
this.name = name;
}
@Override
public String toString() {
return "Data02 [id=" + id + ", name=" + name + "]";
}
}
2.定义链表
// 定义链表
class Linked02 {
Data02 data = new Data02(0, "");
// 添加节点
public void add(Data02 Data02) {
// 头节点不能动,需要一个辅助节点
Data02 data2 = data;
while (true) {
if (data2.next == null) {
data2.next = Data02;
break;
} else {
if (Data02.id < data2.next.id) {
Data02 data3 = new Data02();
data3 = data2.next;
data2.next = Data02;
Data02.next = data3;
break;
}
}
data2 = data2.next;
}
}
// 删除某一个节点
public void remove(int id) {
Data02 data2 = data;
while (true) {
if (data2.next != null) {
if (data2.next.id == id) {
data2.next = data2.next.next;
break;
}
data2 = data2.next;
continue;
}
break;
}
}
//更改某个节点
public void alter(Data02 data02){
Data02 data2 = data;
while(true){
if(data02.id==data2.next.id){
data2.next = data02;
break;
}
data2 = data2.next;
}
}
// 遍历链表
public void show() {
Data02 data2 = data;
while (true) {
if (data2.next != null) {
System.out.println(data2.next);
data2 = data2.next;
continue;
}
break;
}
}
}