Leetcode : 83 Remove Duplicates from Sorted List

题目如下:

83Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 1->2->3


代码如下:

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        myhead=head
        while (myhead.next!=None):
            if(myhead.val==myhead.next.val):
                tem=myhead.next
                myhead.next=tem.next
        
            if(myhead.val!=myhead.next.val):
                myhead=myhead.next



分析如下:

好像没什么好分析的,要注意判别一下头指针是不是空的


结果如下:



猜你喜欢

转载自blog.csdn.net/qq_41794348/article/details/80150438