链表的插入和删除操作

class Node{
	int val;
	Node next;
	Node(int val){
		this.val=val;
		this.next=null;
	}
	public String toString(){
		return String.format("Node(%d)",val);
	}
}
public class MyLinkedList{
	//头插
	private static Node pushFront(Node head,int val){
		Node node=new Node(val);
		node.next=head;
		return node;
	}
	//尾插
	private static Node pushBack(Node head,int val){
		Node node=new Node(val);
		if(head==null){
			return node;
		}
		else{
			Node last=head;
			while(last.next!=null){
				last=last.next;
		    }
		    last.next=node;
	     	return head;
		}
	}
	//头删
	private static Node popFront(Node head) {
		if(head==null){
			System.err.println("空链表无法删除！");
			return null;
		}
		return head.next;
	}
	//尾删
	private static Node popBack(Node head) {
		if(head==null){
			System.err.println("空链表无法删除！");
			return null;
		}
		if(head.next==null){//链表中只有一个值
			return null;
		}
		else{
			Node secondToLast=head;
			while(secondToLast.next!=null){
				secondToLast=secondToLast.next;
			}
			secondToLast.next=null;
			return head;
		}
	}
	//打印
	private static void print(Node head){
		System.out.print("链表为；");
		for(Node cur=head;cur!=null;cur=cur.next){
			System.out.print(cur+"--->");
		}
		System.out.println("null");
	}
	public static void main(String[] args){
		Node head=null;
		head=pushFront(head,5);
		head=pushFront(head,7);
		head=pushFront(head,2);
		print(head);
		head=pushBack(head,37);
		head=pushBack(head,55);
		head=pushBack(head,21);
		print(head);
		head=popFront(head);
		head=popFront(head);
		print(head);
		head=popBack(head);
		head=popBack(head);
		print(head);
	}
}