给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。
输入: 1->2->3->3->4->4->5 输出: 1->2->5
输入: 1->1->1->2->3 输出: 2->3
# Definition for singly-linked list.
# class ListNode
# attr_accessor :val, :next
# def initialize(val = 0, _next = nil)
# @val = val
# @next = _next
# end
# end
# @param {ListNode} head
# @return {ListNode}
def delete_duplicates(head)
dummy = ListNode.new(0, head)
curr = dummy
until curr.nil?
if !curr.next.nil? && !curr.next.next.nil? && curr.next.val == curr.next.next.val
curr.next.next = curr.next.next.next while !curr.next.next.nil? && curr.next.val == curr.next.next.val
curr.next = curr.next.next
else
curr = curr.next
end
end
dummy.next
end