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