[Swift]LeetCode928. 尽量减少恶意软件的传播 II | Minimize Malware Spread II

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9825788.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

(This problem is the same as Minimize Malware Spread, with the differences bolded.)

In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.

Some nodes initial are initially infected by malware.  Whenever two nodes are directly connected and at least one of those two nodes is infected by malware, both nodes will be infected by malware.  This spread of malware will continue until no more nodes can be infected in this manner.

Suppose M(initial) is the final number of nodes infected with malware in the entire network, after the spread of malware stops.

We will remove one node from the initial list, completely removing it and any connections from this node to any other node.  Return the node that if removed, would minimize M(initial).  If multiple nodes could be removed to minimize M(initial), return such a node with the smallest index.

Example 1:

Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
Output: 0

Example 2:

Input: graph = [[1,1,0],[1,1,1],[0,1,1]], initial = [0,1]
Output: 1

Example 3:

Input: graph = [[1,1,0,0],[1,1,1,0],[0,1,1,1],[0,0,1,1]], initial = [0,1]
Output: 1

 Note:

1. 1 < graph.length = graph[0].length <= 300
2. 0 <= graph[i][j] == graph[j][i] <= 1
3. graph[i][i] = 1
4. 1 <= initial.length < graph.length
5. 0 <= initial[i] < graph.length

---

(这个问题与 尽量减少恶意软件的传播 是一样的，不同之处用粗体表示。)

在节点网络中，只有当 graph[i][j] = 1 时，每个节点 i 能够直接连接到另一个节点 j。

一些节点 initial 最初被恶意软件感染。只要两个节点直接连接，且其中至少一个节点受到恶意软件的感染，那么两个节点都将被恶意软件感染。这种恶意软件的传播将继续，直到没有更多的节点可以被这种方式感染。

假设 M(initial) 是在恶意软件停止传播之后，整个网络中感染恶意软件的最终节点数。

我们可以从初始列表中删除一个节点，并完全移除该节点以及从该节点到任何其他节点的任何连接。如果移除这一节点将最小化 M(initial)， 则返回该节点。如果有多个节点满足条件，就返回索引最小的节点。

 示例 1：

输出：graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
输入：0

示例 2：

输入：graph = [[1,1,0],[1,1,1],[0,1,1]], initial = [0,1]
输出：1

示例 3：

输入：graph = [[1,1,0,0],[1,1,1,0],[0,1,1,1],[0,0,1,1]], initial = [0,1]
输出：1

 提示：

1. 1 < graph.length = graph[0].length <= 300
2. 0 <= graph[i][j] == graph[j][i] <= 1
3. graph[i][i] = 1
4. 1 <= initial.length < graph.length
5. 0 <= initial[i] < graph.length

---

 1058ms

class Solution {
    func minMalwareSpread(_ graph: [[Int]], _ initial: [Int]) -> Int {
        var n:Int = graph.count
        var arr = initial.sorted(by: <)
        
        var min:Int = 99999999
        var arg:Int = -1
        for i in arr
        {
            var linf:[Bool] = [Bool](repeating: false,count: n)
            var ds:DJSet =  DJSet(n)
            for j in 0..<n
            {
                for k in (j + 1)..<n
                {
                    if j == i || k == i {continue}
                    if graph[j][k] == 1 {ds.union(j,k)}
                    
                }
            }
            for v in arr
            {
                if v != i
                {
                    linf[ds.root(v)] = true
                }
            }
            var g:Int = 0
            for j in 0..<n
            {
                if linf[ds.root(j)]
                {
                    g += 1
                }
            }
            if g < min
            {
                min = g
                arg = i
            }
            
        }
        return arg
    }
}
class DJSet
{
    var upper:[Int] = [Int]()
    
    init(_ n:Int)
    {
        self.upper = [Int](repeating: -1,count: n)        
    }
    
    func root(_ x:Int) -> Int
    {
        if  upper[x] < 0
        {
            return x
        }
        else
        {
            upper[x] = root(upper[x])
        }
        return upper[x]
    }
    
    func equiv(_ x:Int,_ y:Int) -> Bool
    {
        return root(x) == root(y)
    }
    
    func union(_ x:Int,_ y:Int) -> Bool
    {
       var x = root(x)
       var y = root(y)
        if x != y
        {
            if upper[y] < upper[x]
            {
                var d:Int = x
                x = y
                y = d
            }
            upper[x] += upper[y]
            upper[y] = x
        }
        return x == y
    }
    
    func count() -> Int
    {
        var ct:Int = 0
        for u in upper
        {
            if u < 0
            {
                ct += 1
            }
        }
        return ct
    }
}    

---

2020ms

class Solution {
  var visited: Set<Int> = Set()
  var initial: Set<Int> = Set() 
  var graph : [[Int]] = []
  
  func traverse(_ pos: Int) -> Int {
    if visited.contains(pos) { 
      return 0 
    }
    var result = 1
    visited.insert(pos)
    for i in 0..<graph.count {
      if i != pos && graph[pos][i] == 1 {
        if !visited.contains(i) {
          result += traverse(i)
        }
      }
    }
    return result
  }
  
  func countComponent(_ start: Int) -> Int {
    return traverse(start)
  }
  
  func minMalwareSpread(_ graph: [[Int]], _ initial: [Int]) -> Int {
    self.graph = graph
    self.initial = Set<Int>(initial)
    
    var mincnt = graph.count
    var mini = -1
    
    for removed in initial.sorted() {
      visited = Set()
      visited.insert(removed)
      var n = 0
      for x in initial {
        n += countComponent(x)
      }
      if n < mincnt {
        mincnt = n
        mini = removed
      }
    }

    return mini
  }
}

---

2696ms

class Solution {
    func minMalwareSpread(_ graph: [[Int]], _ initial: [Int]) -> Int {
        var n:Int = graph.count
        var arr = initial.sorted(by: <)
        
        var min:Int = 99999999
        var arg:Int = -1
        for i in arr
        {
            var linf:[Bool] = [Bool](repeating: false,count: n)
            var ds:DJSet =  DJSet(n)
            for j in 0..<n
            {
                for k in (j + 1)..<n
                {
                    if j == i || k == i {continue}
                    if graph[j][k] == 1 {ds.union(j,k)}
                    
                }
            }
            for v in arr
            {
                if v != i
                {
                    linf[ds.root(v)] = true
                }
            }
            var g:Int = 0
            for j in 0..<n
            {
                if linf[ds.root(j)]
                {
                    g += 1
                }
            }
            if g < min
            {
                min = g
                arg = i
            }
            
        }
        return arg
    }
}
class DJSet
{
    var upper:[Int] = [Int]()
    
    init(_ n:Int)
    {
        self.upper = [Int](repeating: -1,count: n)        
    }
    
    func root(_ x:Int) -> Int
    {
        if  upper[x] < 0
        {
            return x
        }
        else
        {
            upper[x] = root(upper[x])
        }
        return upper[x]
    }
    
    func equiv(_ x:Int,_ y:Int) -> Bool
    {
        return root(x) == root(y)
    }
    
    func union(_ x:Int,_ y:Int) -> Bool
    {
       var x = root(x)
       var y = root(y)
        if x != y
        {
            if upper[y] < upper[x]
            {
                var d:Int = x
                x = y
                y = d
            }
            upper[x] += upper[y]
            upper[y] = x
        }
        return x == y
    }
    
    func count() -> Int
    {
        var ct:Int = 0
        for u in upper
        {
            if u < 0
            {
                ct += 1
            }
        }
        return ct
    }
}