单链表

用java基本实现单链表

package datastructure_1;

public class SingleLinkedList {
public static void main(String[] args) {
SingleLinkedList s = new SingleLinkedList();
Node n = new Node(“m”);
Node n1 = new Node(“z”);
s.add(n);
s.add(n1);
// s.add(new Node(“z”));
s.add(new Node(“t”));
s.add(4,new Node(“s”));
// s.update(“s”, “l”);
s.delete(n1);
s.showList();
}
Node head = new Node("");
//添加链表(添加到最后位置)
public void add(Node n) {
//由于head头节点不能移动 需要辅助遍历
Node temp = head;
while(temp.next!=null) {
temp = temp.next;
}
temp.next = n;
n.next = null;
}
//添加链表(添加到指定位置)
public void add(int a,Node n) {
//由于head头节点不能移动 需要辅助遍历
Node temp = head;
int i = 1;
while(temp.next!=null&&i<a) {
temp = temp.next;
i++;
}
n.next = temp.next;
temp.next = n;
}
//删除一个结点
public void delete(Node n) {
Node temp = head.next;
if(head.next == n) {
head.next = head.next.next;
}
while(temp!=null&&temp!=n) {
temp = temp.next;
}
temp.next = temp.next.next;
}
//对节点内容的修改
public void update(Object o1,Object o) {//输入需要修改的美容 与修改后的内容
Node temp = head.next;
while(temp!=null) {
if(temp.element.equals(o1)) {
temp.element = o;
break;
}
temp = temp.next;
}
}
//判断链表是否为空
public boolean isEmpty() {
if(head.next == null) {
return true;
}
return false;
}
//显示链表
public void showList() {
if(isEmpty()) {
System.out.println(“链表为空,请插入元素”);
}
Node temp = head.next;
while(temp!=null) {
System.out.println(temp.element);
temp = temp.next;
}
}
}
class Node{
public Object element;
public Node next;
public Node(Object element, Node next) {
super();
this.element = element;
this.next = next;
}
public Node(Object element) {
super();
this.element = element;
}
public Node() {
super();
// TODO Auto-generated constructor stub
}
public Object getElement() {
return element;
}
public void setElement(Object element) {
this.element = element;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}

}