Leecode 83

给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。

示例 1:

输入: 1->1->2
输出: 1->2

示例 2:

输入: 1->1->2->3->3
输出: 1->2->3

方法一:

# 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
        """
        ptr = head
        temp = []
        while ptr:
            temp.append(ptr.val)
            ptr = ptr.next
        temp1 = []
        for item in temp:
            if item not in temp1:
                temp1.append(item)
        ptr1 = ListNode(0)
        head1 = ptr1
        for item in temp1:
            ptr1.next = ListNode(item)
            ptr1 = ptr1.next
        return head1.next

方法二:

# 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
        """
        ptr = head
        if head is None:
            return []
        while head.next:
            if head.val == head.next.val:
                head.next = head.next.next
            else:
                head = head.next
        return ptr

 二刷之后的方法三：

# 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
        """
        if head is None:
            return []
        root = head
        current = head.next
        prev = head
        while current:
            if current.val == prev.val:
                prev.next = current.next
                current = current.next
            else:
                prev = prev.next
        return root