链表的增删_Java语言编写

链表的增删

遍历打印链表：

Node cur = head;
while(cur!=null){
	System.out.println(cur.val);
	cur=cur.next;
}

	private static void print(Node head) {
		System.out.println("打印链表：");
		for (Node cur = head; cur != null; cur = cur.next) {
			System.out.print(cur + " --> ");
		}
		System.out.println("null");
	}

练习代码

// 前驱 prev    后继 next
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 {

    // 打印
    public static void print(Node head){
        System.out.println("打印链表：");
        for (Node cur=head;cur!=null;cur=cur.next){
            System.out.print(cur+"-->");
        }
        System.out.println("null");
    }

    // 头插
    // head: 原来的第一个结点
    // val：要插入的值
    // 返回：新的第一个结点
    private static Node pushFront(Node head,int val) {
        // 1. 结点
        // 2. 让原来的 head 成为 node 的下一个结点
        // 3. 更新第一个结点的引用
        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 void pushAfter(Node pos, int val) {
        Node node=new Node(val);
        node.next=pos.next;
        pos.next=node;
    }

    //头删
    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 lastSecond=head;
            while(lastSecond.next.next !=null){
                lastSecond=lastSecond.next;
            }
            lastSecond.next=null;
            return head;
        }
    }

    //删除
    private static void popAfter(Node pos) {
        pos.next=pos.next.next;
    }

    public static void main(String[] args) {
        Node head = null;

        // 头插
        head = pushFront(head, 0);
        head = pushFront(head, 1);
        head = pushFront(head, 2);

        // 打印
        print(head);	// 2 1 0

        // 尾插
        head = popFront(head);
        print(head);	// 1 0

        head = pushBack(head, 10);
        head = pushBack(head, 20);
        head = pushBack(head, 30);
        print(head);	// 1 0 10 20 30
        head = popBack(head);
        head = popBack(head);
        head = popBack(head);
        head = popBack(head);
        head = popBack(head);

        head = popBack(head);	// 报错
        print(head);		// 空

        head = pushBack(head, 100);
        print(head);		// 100
    }
}