首页 > 代码库 > [Leetcode] Remove Duplicates from Sorted List
[Leetcode] Remove Duplicates from Sorted List
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.
Solution:
Approach: "Building-block" methods: basic operation - Deleting node
current.next = current.next.next # remove 2nd duplicated node# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # @param head, a ListNode # @return a ListNode def deleteDuplicates(self, head): #迭代版，时间复杂度O(n)，空间复杂度O(1) current = head while current and current.next: if current.val == current.next.val: current.next = current.next.next # remove 2nd duplicated node else: current = current.next return head
[Leetcode] Remove Duplicates from Sorted List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。