# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param head ListNode类 # @return ListNode类 # class Solution: def deleteDuplicates(self , head: ListNode) -> ListNode: # write code here if not head: return head cur = head nxt = head.next while cur: if nxt and nxt.val == cur.val: nxt = nxt.next continue else: cur.next = nxt cur = cur.next return head
1.单独处理空链表
2.当nxt不为空 并且nxt和cur val值相等时,nxt 继续遍历
3.找到不同时 进行删除节点的操作