78 leetcode - Remove Duplicates from Sorted List

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
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
        """
        if head == None or head.next == None:
            return head

        ret = head
        cur = head
        head = head.next
        while head != None:
            if head.val != cur.val:
                cur.next = head
                cur = cur.next
            head = head.next
        cur.next = None
        return ret

if __name__ == "__main__":
    s = Solution()
    head = ListNode(1)
    t = head
    for i in [1,2,2,3,3,5,6]:
        t.next = ListNode(i)
        t = t.next
    t.next = None
    t = head
    while t != None:
        print t.val
        t = t.next
    t = s.deleteDuplicates(head)
    while t != None:
        print t.val
        t = t.next
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值