题目描述
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表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)
{
if(pHead==null || pHead.next==null)
return pHead;
ListNode dummy = new ListNode(0);//添加冗余节点
dummy.next = pHead;
ListNode pre = dummy;
ListNode cur = pHead;
while(cur.next!=null){
if(cur.val==cur.next.val){
int temp = cur.val;
while(cur!=null&&cur.val==temp){
cur = cur.next;
}
pre.next = cur;
if(cur==null) break;
}
else{
pre = cur;
cur = cur.next;
}
}
return dummy.next;
}
}