[LeetCode]83. Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

Solution: 遍历数组

Running Time: O(n)

解法一：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

#1st solution: general idea: use hashset
class Solution:
    # @param head, a ListNode
    # @return a ListNode
    def deleteDuplicates(self, head):
        node = head
        valueList = []
        if node:
            valueList.append(head.val)
        else:
            return None
        while node.next:
            if node.next.val not in valueList:
                valueList.append(node.next.val)
                node = node.next
            else:
                node.next = node.next.next
        return head

解法二：由于是已排序链表，可以两两比较结点，删除重复结点，否则跳转到下一个。

# #2nd solution: as it's a sorted linked list, compare cur.val and cur.next.val.
class Solution:
    # @param head, a ListNode
    # @return a ListNode
    def deleteDuplicates(self, head):
        node = head
        if head is None:
            return head
        while head and head.next:
            if head.val == head.next.val:
                head.next = head.next.next
            else:
                head = head.next
        return node