博客域名:
http://www.xnerv.wang
原题页面: https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
题目类型:链表
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/3465647
有序链表的去重,注意及时检查一些引用是否为None。
原题页面: https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
题目类型:链表
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/3465647
Given a sorted linked list, delete all duplicates such that each element appear onlyonce.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
有序链表的去重,注意及时检查一些引用是否为None。
class Solution:
# @param head, a ListNode
# @return a ListNode
def deleteDuplicates(self, head):
if None == head or None == head.next:
return head
cur = head
while None != cur:
if None != cur.next and cur.val == cur.next.val:
cur.next = cur.next.next
continue
else:
cur = cur.next
return head