Java面试题目:实现链表及其常用方法
public class Mylink {
private int length; //链表长度
private Node head; //链表的头节点
private Node rear; //链表的尾结点
private Node p; //头指针
private class Node {
private Object data; //节点的数据
private Node next; //节点的后继节点的引用地址
public Node() {
this.data = null;
}
public Node(Object e) {
this.data = e;
}
}
//构造方法-创建一个头节点 头结点是首元节点之前的附设的一个节点
public Mylink() {
head = new Node();
rear = head;
head.next = null;
length = 0;
}
//头部插入数据
public void addNode(Object e) {
if(head == null) {
return;
}
Node node = new Node(e);
node.next = head.next;
head.next = node;
length++;
}
//尾部插入数据
public void addNodeInRear(Object e) {
if(head == null) {
return;
}
Node node = new Node(e);
rear.next = node;
node.next = null;
rear = node;
length++;
}
//在第i个位置插入值e
public void inset(int i,Object e) {
if(head == null) {
return;
}
int j = 0;
p = head;
while(p!=null) {
j++;
if(j==i){
Node node = new Node(e);
node.next = p.next;
p.next = node;
length++;
break;
}
p = p.next;
}
}
//删除第i个节点
public void deleteNode(int i){
if(head == null){
return;
}
int j = 0;
p = head;
while(p.next!=null){
j++;
if(j == i) {
p.next = p.next.next;
length--;
break;
}
p = p.next;
}
}
//求当前链表的长度
public int linkLength(){
return length;
}
@Override
public String toString(){
p = head.next;
StringBuilder strb = new StringBuilder();
while (p!=null) {
strb.append(p.data+"\t");
p = p.next;
}
return strb.toString();
}
public static void main(String[] args) {
Mylink mylink = new Mylink();
System.out.println("链表的初始值为:"+mylink.toString());
mylink.addNode(1);
mylink.addNode(3);
mylink.addNode(5);
mylink.inset(2,9);
System.out.println("链表为:"+mylink.toString());
mylink.deleteNode(4);
System.out.println("删除结点后链表为:"+mylink.toString());
}
}