题目描述
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } } */ public class Solution { public ListNode deleteDuplication(ListNode pHead) { ListNode dummy = new ListNode(0); ListNode p = dummy; dummy.next = pHead; ListNode lastNode = dummy; while (p.next != null) { if (p.val == p.next.val) { while (p.next != null && p.val == p.next.val) { p.next = p.next.next; } lastNode.next = p.next; p = lastNode.next; if (p == null) break; } else { lastNode = p; p = p.next; } } return dummy.next; } }