Merge pull request kodecocodes#157 from chris-pilcher/set-cover-unweighted-link

Set cover unweighted link

Author: Chris Pilcher

Diff for: Set Cover (Unweighted)/SetCover.playground/Sources/SetCover.swift

@@ -18,13 +18,13 @@ public extension Set {
       return largestSet
     }
 
-    while remainingSet.count != 0 {
+    while !remainingSet.isEmpty {
       guard let largestSet = largestIntersectingSet() else { break }
       result!.append(largestSet)
       remainingSet = remainingSet.subtract(largestSet)
     }
 
-    if remainingSet.count != 0 || self.count == 0 {
+    if !remainingSet.isEmpty || isEmpty {
       result = nil
     }
 

Diff for: Set Cover (Unweighted)/SetCover.playground/playground.xcworkspace/contents.xcworkspacedata

@@ -18,13 +18,13 @@ extension Set {
       return largestSet
     }
 
-    while remainingSet.count != 0 {
+    while !remainingSet.isEmpty {
       guard let largestSet = largestIntersectingSet() else { break }
       result!.append(largestSet)
       remainingSet = remainingSet.subtract(largestSet)
     }
 
-    if remainingSet.count != 0 || self.count == 0 {
+    if !remainingSet.isEmpty || isEmpty {
       result = nil
     }
 

Diff for: Set Cover (Unweighted)/SetCover.swift

@@ -28,3 +28,4 @@ Special-purpose sorts:
 
 - [Minimum Edit Distance](Minimum Edit Distance/). Measure the similarity of two strings by counting the number of operations required to transform one string into the other.
 - [Treap](Treap/)
+- [Set Cover (Unweighted)](Set Cover (Unweighted)/)