class ListNode {
public int data;
public ListNode next;
public ListNode prev;
public ListNode(int data) {
this.data = data;
}
}
public class DoubleList {
public ListNode head;
public ListNode last;//尾巴
//头插法
public void addFirst(int data){
ListNode node = new ListNode(data);
if(this.head == null) {
this.head = node;
this.last = node;
}else {
node.next = this.head;
this.head.prev = node;
this.head = node;
}
}
//尾插法
public void addLast(int data){
ListNode node = new ListNode(data);
if(this.head == null) {
this.head = node;
this.last = node;
}else {
this.last.next = node;
node.prev = this.last;
this.last = node;
}
}
//打印
public void display(){
ListNode cur = this.head;
while (cur != null) {
System.out.print(cur.data+" ");
cur = cur.next;
}
System.out.println();
}
//任意位置插入,第一个数据节点为0号下标
private ListNode searchIndex(int index) {
if(index < 0 || index >= size()) {
return null;
}
ListNode cur = this.head;
while (index > 0) {
cur = cur.next;
index--;
}
return cur;
}
public void addIndex(int index,int data){
if(index == 0) {
addFirst(data);
return ;
}
if(index == size()) {
addLast(data);
return ;
}
//中间插入
ListNode node = new ListNode(data);
ListNode cur = searchIndex(index);
if(cur == null) {
return ;
}
node.next = cur;
cur.prev.next = node;
node.prev = cur.prev;
cur.prev = node;
}
//得到单链表的长度
public int size(){
ListNode cur = this.head;
int count = 0;
while (cur != null) {
count++;
cur = cur.next;
}
return count;
}
//查找是否包含关键字key是否在链表当中
public boolean contains(int key){
ListNode cur = this.head;
while (cur != null) {
if(cur.data == key) {
return true;
}
cur = cur.next;
}
return false;
}
//删除第一次出现关键字为key的节点
public void remove(int key){
ListNode cur = this.head;
while (cur != null) {
if(cur.data == key) {
//3种情况
if(cur == this.head) {
this.head = this.head.next;
this.head.prev = null;
}else {
//中间位置和尾巴
cur.prev.next = cur.next;
if(cur.next != null) {
cur.next.prev = cur.prev;
}else {
this.last = cur.prev;
}
}
return;
}
cur = cur.next;
}
}
//删除所有值为key的节点
public void removeAllKey(int key){
ListNode cur = this.head;
while (cur != null) {
if(cur.data == key) {
//3种情况
if(cur == this.head) {
this.head = this.head.next;
this.head.prev = null;
}else {
//中间位置和尾巴
cur.prev.next = cur.next;
if(cur.next != null) {
cur.next.prev = cur.prev;
}else {
this.last = cur.prev;
}
}
}
cur = cur.next;
}
}
//清除双链表
public void clear(){
while (this.head != null) {
ListNode cur = this.head.next;
this.head.next = null;
this.head.prev = null;
this.head = cur;
//cur = cur.next;
}
this.last = null;
}
public static void main(String[] args) {
DoubleList doubleList = new DoubleList();
doubleList.addLast(1);
doubleList.addLast(2);
doubleList.addLast(3);
doubleList.addLast(3);
doubleList.addLast(4);
doubleList.addLast(5);
doubleList.addLast(5);
doubleList.addLast(6);
doubleList.display();
doubleList.remove(3);
doubleList.removeAllKey(5);
doubleList.display();
doubleList.searchIndex(6);
doubleList.clear();
System.out.println(doubleList.size());
}
}