给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。
示例 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) {
ListNode result = new ListNode(0);
ListNode curr = result;
Integer temp = -100;
while (head != null) {
ListNode next = head.next;
if ((next == null && temp != head.val) || (next != null && temp != head.val && next.val != head.val)) {
ListNode node = new ListNode(head.val);
curr.next = node;
curr = curr.next;
}
temp = head.val;
head = head.next;
}
return result.next;
}
}