单链表 java实现

创建单链表的节点类

package com.wang.linkedList;

public class LinkedListNode {
public LinkedListNode next;
public int data;
public LinkedListNode(){};
public LinkedListNode(int data) {
this.data = data;
}


public int getData() {
return data;
}
}

创建单链表的类

package com.wang.linkedList;

import java.util.Scanner;
public class LinkedList {
private LinkedListNode header;
private int length = 0;
private int data;
// 创建单链表
public void create() {
Scanner scan = new Scanner(System.in);
data = scan.nextInt();
header = new LinkedListNode();
header.next = new LinkedListNode(data);
LinkedListNode p = header.next;
length++;
while((data = scan.nextInt())!=-1) {
LinkedListNode q = new LinkedListNode(data);
p.next = q;
p = q;
length++;
}
}

// 在头结点后插入元素
public void addFirst(int data) {
LinkedListNode node = new LinkedListNode(data);
if (header == null) {
header = new LinkedListNode();
header.next = node;
length++;
} else {
node.next = header.next;
header.next = node;
length++;
}
}


public void intsert(int data, int index) {
// 先声明一个要插入的节点
LinkedListNode newNode = new LinkedListNode(data);
// 判断头结点是否为空，如果为空，判断index是否为1，如果是1，则进行插入
if (header == null) {
if (index == 1) {
header = new LinkedListNode();
header.next = newNode;
} else {
System.out.println("插入无效");
}
} else {
LinkedListNode p = header.next;// 定义节点p，为头结点的下一个节点
LinkedListNode prep = header;// 定义prep指向header
int i = 0;
while (p != null) {
i++;
if (i == index) {
newNode.next = p;
prep.next = newNode;
length++;
}
prep = p;
p = p.next;
}
}
}


// 根据index删除链表中的相应元素
public void delete(int index) {
LinkedListNode p = header.next;
LinkedListNode prep = header;
int i = 0;
while (p != null) {
i++;
if (i == index) {
prep.next = p.next;
}
prep = p;
p = p.next;
}
length--;
}


// 判断链表是否为空
public boolean isEmpty() {
if (header == null) {
return true;
} else {
return false;
}
}


// 获取data的位置
public void getIndex(int data) {
LinkedList linkedList = new LinkedList();
LinkedListNode p = header;
if (p == null) {
System.out.println("链表为空，不能获取位置....");
} else {
int i = 0;
while (p.getData() != data) {
i++;
p = p.next;
}
System.out.println("该值所在位置" + i);
}


}

// 输出链表元素
public void print() {
LinkedListNode p = header.next;// 将header付给p引用
/*
* 如果p的后继节点不为空，那么就打印出p的数据域，并让p指向其后继节点
*/
while (p.next != null) {
System.out.println(p.getData());
p = p.next;
}
System.out.println(p.getData());
System.out.println("链表长度为" + length);
}

}

测试类

package com.wang.linkedList;

public class Test {
public static void main(String[] args) {
LinkedList l = new LinkedList();
l.create();
l.intsert(19, 1);
l.intsert(10, 1);
l.intsert(11, 2);
l.addFirst(99);
l.delete(1);
// l.getIndex(99);
l.print();
System.out.println(l.isEmpty());
}
}