[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.

• 解题思路：链表节点的去重。比较简单。

# Definition for singly-linked list.# class ListNode(object):#     def __init__(self, x):#         self.val = x#         self.next = Noneclass Solution:    # @param head, a ListNode    # @return a ListNode    def deleteDuplicates(self, head):        if head == None or head.next == None:            return head        p = head        while p.next:            if p.val == p.next.val:                p.next = p.next.next            else:                p = p.next        return head