算法 - 删除链表重复值

定义一个虚节点，指向head节点，然后遍历cur节点，如果当cur的next不为空且cur的next的val等于cur的val，先将cur = cur的next，然后让其一直循环往下继续遍历。

package com.lhb.nowcode;

/**
 * @author lhb
 * @date 2022/3/21
 */
public class NC278 {
    static class ListNode {
        int val;
        ListNode next;

        public ListNode(int val) {
            this.val = val;
        }

        public ListNode() {
        }
    }
    public static ListNode deleteDuplication(ListNode head) {
        ListNode dummy= new ListNode(-1);
        dummy.next = head;
        ListNode prev = dummy;
        ListNode cur = head;
        while (cur != null) {
            if (cur.next != null && cur.next.val == cur.val) {
                cur = cur.next;
                while (cur.next != null && cur.next.val == cur.val) {
                    cur = cur.next;
                }
                cur = cur.next;
                prev.next = cur;
            } else {
                prev.next = cur;
                cur = cur.next;
            }
        }
        return dummy.next;
    }
}