forked from kodecocodes/swift-algorithm-club
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSetCover.swift
33 lines (27 loc) · 876 Bytes
/
SetCover.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
extension Set {
func cover(within array: Array<Set<Element>>) -> Array<Set<Element>>? {
var result: [Set<Element>]? = [Set<Element>]()
var remainingSet = self
func largestIntersectingSet() -> Set<Element>? {
var largestIntersectionLength = 0
var largestSet: Set<Element>?
for set in array {
let intersectionLength = remainingSet.intersect(set).count
if intersectionLength > largestIntersectionLength {
largestIntersectionLength = intersectionLength
largestSet = set
}
}
return largestSet
}
while !remainingSet.isEmpty {
guard let largestSet = largestIntersectingSet() else { break }
result!.append(largestSet)
remainingSet = remainingSet.subtract(largestSet)
}
if !remainingSet.isEmpty || isEmpty {
result = nil
}
return result
}
}