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 = None

class Solution(object):
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        delflag = 1
        flag = 1
        p = head
        while p != None and p.next != None:
        	if p.val != p.next.val:
        		flag = 1
        		p = p.next
        	elif flag < delflag:
        		flag += 1
        		p = p.next
        	else:
        		p.next = p.next.next
        return head