剑指offer-56：删除链表中重复的结点

题目描述

在一个排序的链表中，存在重复的结点，请删除该链表中重复的结点，重复的结点不保留，返回链表头指针。 例如，链表1->2->3->3->4->4->5 处理后为 1->2->5

代码

public class Solution56 {


    public ListNode deleteDuplication(ListNode pHead) {


        ListNode first = new ListNode(-1);//设置一个trick
        first.next = pHead;
        
        ListNode p = pHead;
        ListNode last = first;
        while (p != null && p.next != null) {
            if (p.val == p.next.val) {
                int val = p.val;
                while (p != null && p.val == val)
                    p = p.next;
                last.next = p;
            } else {
                last = p;//指向位置p
                p = p.next;//p后移
            }
        }
        return first.next;


    }


    @SuppressWarnings("Duplicates")
    public static void main(String[] args) {


        ListNode node1 = new ListNode(1);
        ListNode node2 = new ListNode(2);
        ListNode node3 = new ListNode(3);
        ListNode node4 = new ListNode(3);
        ListNode node5 = new ListNode(4);
        ListNode node6 = new ListNode(4);
        ListNode node7 = new ListNode(5);

        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        node4.next = node5;
        node5.next = node6;
        node6.next = node7;
        ListNode node = new Solution56().deleteDuplication(node1);
        while (node != null) {
            BeanUtil.print(node.val);
            node = node.next;

        }


    }

}