【数据结构与算法】【LeetCode】【链表】83. 删除排序链表中的重复元素

# Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
def createLink_rearinsert(lista):
    head = ListNode(-1)
    rear = head
    for i in lista:
        new_node=ListNode(i)
        rear.next=new_node
        rear=new_node
    return head.next
class Solution(object):
    def deleteDuplicates(self, head):
        if not (head and head.next):
            return head
        current=head
        while current!=None and current.next!=None:
            if current.next.val==current.val:
                current.next=current.next.next
            else:
                current=current.next
        return head

if __name__=="__main__":
    a=[1,1,1,2,4,4]
    new_a=createLink_rearinsert(a)
    a1 = Solution()
    p=a1.deleteDuplicates(new_a)
    list1=[]
    while(p!=None):
        list1.append(p.val)
        #print(p.val)
        p=p.next
    print(list1)

# Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
def createLink_rearinsert(lista):
    head = ListNode(-1)
    rear = head
    for i in lista:
        new_node=ListNode(i)
        rear.next=new_node
        rear=new_node
    return head.next
class Solution(object):
    def deleteDuplicates(self, head):
        if not (head and head.next):
            return head
        a = head
        b = head.next
        while b:
            if a.val!=b.val:
                a=b
                b=b.next
            else:
                while b and a.val==b.val:
                    b = b.next

                a.next = b
                a=b
                b = b.next if b else None
        return head

if __name__=="__main__":
    a=[1,1,1,2,4,4]
    new_a=createLink_rearinsert(a)
    a1 = Solution()
    p=a1.deleteDuplicates(new_a)
    list1=[]
    while(p!=None):
        list1.append(p.val)
        #print(p.val)
        p=p.next
    print(list1)