Leecode第83题,纯手写一遍过,也是课堂教过的算法
思路:循环处理,出循环条件是c.next==None(没有下一个,自然不会重复了),其他时候自己与下一位判断,若重复则将指针跳过去,若不重复则将指针往下移一位。`# 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
“”"
c=head
if cNone or c.nextNone:
return head
while c.next!=None:
if c.val==c.next.val:
c.next=c.next.next
continue
c=c.next
return head`