LeetCode-83 Remove Duplicates from Sorted List

Description

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

Example

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

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

Submissions

首先已知链表是有序的，因此只需遍历链表即可。解题思路考虑遍历时当前结点的值与下一结点的值，如果相等则移除下一结点，即保持当前结点不变，下一结点变成原来的下下结点。如果两结点值不相等，则只需将结点指针后移一位。最后遍历完成返回链表即可。

实现代码如下:

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def deleteDuplicates(self, head: ListNode) -> ListNode:
        p = head
        while p and p.next:
            if p.val == p.next.val:
                p.next = p.next.next
            else:
                p = p.next
        return head