[剑指offer]删除链表中的重复节点【python】

题目描述

在一个排序的链表中，存在重复的结点，请删除该链表中重复的结点，重复的结点不保留，返回链表头指针。 例如，链表1->2->3->3->4->4->5 处理后为 1->2->5

思路描述：

链表，构建一个pre节点，一个next节点，还有一个当前节点p， 比较p和next的值是否相同~

ps:以前做链表的题都是新建list存放node,在进行后续操作，复杂度上升~get 新技能，可以直接定义一个类似于指针的变量

class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
class Solution:
    def deleteDuplication(self, pHead):
        # write code here
        if not pHead or not pHead.next:
            return pHead
        new_head = ListNode(-1)
        new_head.next = pHead  # former node

        pre = new_head
        p = pHead  # cur node
        next = None
        while p and p.next:
            next = p.next  # later node
            if p.val == next.val:
                while next and next.val == p.val:
                    next = next.next
                p = next
                pre.next = next
            else:
                pre = p
                p = next
        return new_head.next
fun = Solution()
n1 = ListNode(1)
n2 = ListNode(1)
n3 = ListNode(1)
n4 = ListNode(1)
n5 = ListNode(1)
n6 = ListNode(1)
n7 = ListNode(1)

n1.next = n2
n2.next = n3
n3.next = n4
n4.next = n5
n5.next = n6
n6.next = n7
ans = fun.deleteDuplication(n1)