删除链表中重复的结点
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
示例1
输入
{1,2,3,3,4,4,5}
输出
{1,2,5}
解析:
首先判空,如果输入链表为空或链表只有一个结点则返回原链表
然后创建一个头结点,避免出现第一个结点和第二个节点相同
遍历链表,用双指针进行拼接
class Solution
{
public ListNode deleteDuplication(ListNode pHead)
{
if (pHead == null || pHead.next == null)
{
return pHead;
}
ListNode head = new ListNode(-1);
head.next = pHead;
ListNode prev = head;
ListNode last = head.next;
while (last != null)
{
if (last.next != null && last.val == last.next.val)
{
// 找到最后的一个相同节点
while (last.next != null && last.val == last.next.val)
{
last = last.next;
}
prev.next = last.next;
last = last.next;
} else
{
prev = prev.next;
last = last.next;
}
}
return head.next;
}
}
ListNode newHead = new ListNode(-1);
ListNode temp = newHead;
ListNode cur = pHead;
while (cur != null)
{
if (cur.next != null && cur.val == cur.next.val)
{
while (cur.next != null && cur.val == cur.next.val)
{
cur = cur.next;
}
cur = cur.next;
} else
{
temp.next = cur;
temp = cur;
cur = cur.next;
}
}
temp.next = null;
return newHead.next;