难度中等236收藏分享切换为英文关注反馈
给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。
示例 1:
输入: 1->2->3->3->4->4->5 输出: 1->2->5
示例 2:
输入: 1->1->1->2->3 输出: 2->3
/**
* Definition for singly-linked list.
* public class ListNode {
* public int val;
* public ListNode next;
* public ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode DeleteDuplicates(ListNode head) {
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode curr = dummy;
ListNode check = head;
while (check != null)
{
int val = check.val;
check = check.next;
bool dupe = false;
while (check != null && check.val == val)
{
dupe = true;
check = check.next;
}
if (dupe)
{
curr.next = check;
}
else
{
curr = curr.next;
}
}
return dummy.next;
}
}