Node类
public class Node {
int data;
Node next;
@Override
public String toString() {
return data + "=>" + next;
}
}
单链表类
public class SingleList {
//头节点
private Node head;
private Node tail;
//头插法
public void add(int value){
//
Node node = new Node();
node.data = value;
if(head == null){
head = node;
}else{
node.next = head;
head = node;
}
}
//尾插法
public void tailAdd(int value){
Node node = new Node();
node.data = value;
if(head==null){
head = node;
}else{
Node t = head;
while(t.next!=null){
t = t.next;
}
t.next = node;
}
}
//尾插法2
public void tailAdd2(int value){
Node node = new Node();
node.data = value;
if(head==null){
head = node;
tail = node;
}else{
tail.next = node;
tail=tail.next;
}
}
public boolean delete(int value){
boolean flag =false;
while(head.data==value){
head=head.next;
flag=true;
}
Node temp = head;
while(temp.next!=null){
if(temp.next.data==value){
temp.next=temp.next.next;
flag = true;
}else{
temp = temp.next;
}
}
return flag;
}
public int search(int value){
Node node = head;
while(node!=null){
if(node.data==value){
return 1;
}else{
node=node.next;
}
}
return -1;
}
@Override
public String toString() {
return "SingleList{" +
"head=" + head+
'}';
}
}
class tests{
public static void main(String[] args) {
SingleList singleList = new SingleList();
singleList.add(1);
singleList.add(20);
singleList.add(4);
singleList.delete(1);
System.out.println(singleList.search(1));
System.out.println(singleList);
}
}



