# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
newnodehead = None
newnode = None
node = head
while node:
lastval = node.val
if node.next and node.next.val == lastval:
while node and node.val == lastval:
node=node.next
continue
if not newnodehead:
newnode=ListNode(node.val)
newnodehead=newnode
else:
newnode.next=ListNode(node.val)
newnode=newnode.next
node = node.next
return newnodehead