We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2fdd8b8 commit ef5b8adCopy full SHA for ef5b8ad
Huffman Coding/Huffman.swift
@@ -95,8 +95,7 @@ extension Huffman {
95
while queue.count > 1 {
96
// Find the two nodes with the smallest frequencies that do not have
97
// a parent node yet.
98
- let node1 = queue.dequeue()!
99
- let node2 = queue.dequeue()!
+ guard let node1 = queue.dequeue(), let node2 = queue.dequeue() else { return }
100
101
// Create a new intermediate node.
102
var parentNode = Node()
@@ -115,8 +114,9 @@ extension Huffman {
115
114
}
116
117
// The final remaining node in the queue becomes the root of the tree.
118
- let rootNode = queue.dequeue()!
119
- root = rootNode.index
+ if let rootNode = queue.dequeue() {
+ root = rootNode.index
+ }
120
121
122
0 commit comments