-
-
Notifications
You must be signed in to change notification settings - Fork 10
/
82 Remove Duplicates from Sorted List II.swift
65 lines (53 loc) 路 1.58 KB
/
82 Remove Duplicates from Sorted List II.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//
// 82 Remove Duplicates from Sorted List II.swift
// LeetCode-Solutions
//
// Created by Aleksandar Dinic on 05/01/2021.
// Copyright 漏 2021 Aleksandar Dinic. All rights reserved.
//
import Foundation
/// Source: https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
class Solution {
/// Deletes all nodes that have duplicate numbers, leaving only distinct numbers
/// from the original list.
///
/// - Parameter head: Linked list head.
/// - Returns: Linked list head.
///
/// - Complexity:
/// - time: O(n), where n is the number of nodes in the linked list.
/// - space: O(1), only constant space is used.
func deleteDuplicates(_ head: ListNode?) -> ListNode? {
let dummy: ListNode? = ListNode(-1)
dummy?.next = head
var curr = dummy
while let nextVal = curr?.next?.val, let nextNextVal = curr?.next?.next?.val {
if nextVal == nextNextVal {
let duplicate = nextVal
while curr?.next != nil, curr?.next?.val == duplicate {
curr?.next = curr?.next?.next
}
} else {
curr = curr?.next
}
}
return dummy?.next
}
}
/// Provided code
public class ListNode {
public var val: Int
public var next: ListNode?
public init() {
self.val = 0
self.next = nil
}
public init(_ val: Int) {
self.val = val
self.next = nil
}
public init(_ val: Int, _ next: ListNode?) {
self.val = val
self.next = next
}
}