-
-
Notifications
You must be signed in to change notification settings - Fork 10
/
1721 Swapping Nodes in a Linked List.swift
77 lines (61 loc) · 1.73 KB
/
1721 Swapping Nodes in a Linked List.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
66
67
68
69
70
71
72
73
74
75
76
77
//
// 1721 Swapping Nodes in a Linked List.swift
// LeetCode-Solutions
//
// Created by Aleksandar Dinic on 14/03/2021.
// Copyright © 2021 Aleksandar Dinic. All rights reserved.
//
import Foundation
/// Source: https://leetcode.com/problems/swapping-nodes-in-a-linked-list/
class Solution {
/// Swaps nodes in a linked list.
///
/// - Parameters:
/// - head: Linked list head.
/// - k: An integer.
/// - Returns: Linked list head.
///
/// - Complexity:
/// - time: O(n), where n is the number of nodes in the list.
/// - space: O(1), only constant space is used.
func swapNodes(_ head: ListNode?, _ k: Int) -> ListNode? {
var listLength = 0
var frontNode: ListNode? = nil
var endNode: ListNode? = nil
var currentNode = head
while currentNode != nil {
listLength += 1
if endNode != nil {
endNode = endNode?.next
}
if listLength == k {
frontNode = currentNode
endNode = head
}
currentNode = currentNode?.next
}
guard let frontVal = frontNode?.val,
let endVal = endNode?.val
else { return head }
frontNode?.val = endVal
endNode?.val = frontVal
return head
}
}
/// 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
}
}