题目描述
给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。
示例 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 {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null)
return null;
ListNode dummy = new ListNode(0 == head.val ? 1 : 0);
dummy.next = head;
ListNode pre = dummy;
ListNode cur = head;
ListNode first = dummy;
while(cur != null && cur.next != null){
if(cur.val != pre.val && cur.val != cur.next.val){
first.next = cur;
first = first.next;
}
pre = cur;
cur = cur.next;
}
if(pre.val != cur.val){
first.next = cur;
first = first.next;
}
first.next = null;
return dummy.next;
}
}