Given the head
of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1:
Input: head = [1,1,2] Output: [1,2]
Example 2:
Input: head = [1,1,2,3,3] Output: [1,2,3]
Constraints:
- The number of nodes in the list is in the range
[0, 300]
. -100 <= Node.val <= 100
- The list is guaranteed to be sorted in ascending order.
题目大意:给定一个排好序的链表,对于有相同值的所有节点,删掉多余的节点只保留其中一个节点。
解题思路:首先对于一个排好序的链表,值相同的节点在链表中一定都是连续的,这位我们删除节点提供很大方便。同样有迭代和递归两种解法。
迭代法:从头遍历整个链表,定义一个指针cur指向当前节点,每次循环判断当前节点及其子节点是否存在,如果子节点存在并且值等于当前节点值则删除该子节点,指针cur无需更新进入下一次循环;如果子节点存在但不等于当前节点值,则直接更新指针cur指向子节点进入下一次循环。一直循环直到链表结尾。
# 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: Optional[ListNode]) -> Optional[ListNode]:
cur = head
while cur and cur.next :
if cur.val == cur.next.val :
cur.next = cur.next.next
else :
cur = cur.next
return head
递归法:对于递归函数,当输入的链表所含节点个数小于等于1则直接返回头节点head;如果大于等于2个节点,则先处理前两个节点head和head.next,如果两个值相同则删除第二个节点(head.next = head.next.next),然后递归调用继续处理从head开始的节点;如果两个值不同则递归调用处理从head.next开始的节点。头节点一直没变所以最后直接返回头指针。
# 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: Optional[ListNode]) -> Optional[ListNode]:
if not head or not head.next:
return head
if head.val == head.next.val:
head.next = head.next.next
self.deleteDuplicates(head)
else:
self.deleteDuplicates(head.next)
return head