代码拉取完成，页面将自动刷新
同步操作将从 doocs/leetcode 强制同步，此操作会覆盖自 Fork 仓库以来所做的任何修改，且无法恢复！！！
确定后同步将在后台操作，完成时将刷新页面，请耐心等待。
You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node 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 exactly one node from initial, 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
Constraints:
n == graph.lengthn == graph[i].length2 <= n <= 300graph[i][j] is 0 or 1.graph[i][j] == graph[j][i]graph[i][i] == 11 <= initial.length < n0 <= initial[i] <= n - 1initial are unique.class Solution:
def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int:
def find(x):
if p[x] != x:
p[x] = find(p[x])
return p[x]
def union(a, b):
pa, pb = find(a), find(b)
if pa != pb:
size[pb] += size[pa]
p[pa] = pb
n = len(graph)
p = list(range(n))
size = [1] * n
clean = [True] * n
for i in initial:
clean[i] = False
for i in range(n):
if not clean[i]:
continue
for j in range(i + 1, n):
if clean[j] and graph[i][j] == 1:
union(i, j)
cnt = Counter()
mp = {}
for i in initial:
s = {find(j) for j in range(n) if clean[j] and graph[i][j] == 1}
for root in s:
cnt[root] += 1
mp[i] = s
mx, ans = -1, 0
for i, s in mp.items():
t = sum(size[root] for root in s if cnt[root] == 1)
if mx < t or mx == t and i < ans:
mx, ans = t, i
return ans
class Solution {
private int[] p;
private int[] size;
public int minMalwareSpread(int[][] graph, int[] initial) {
int n = graph.length;
p = new int[n];
size = new int[n];
for (int i = 0; i < n; ++i) {
p[i] = i;
size[i] = 1;
}
boolean[] clean = new boolean[n];
Arrays.fill(clean, true);
for (int i : initial) {
clean[i] = false;
}
for (int i = 0; i < n; ++i) {
if (!clean[i]) {
continue;
}
for (int j = i + 1; j < n; ++j) {
if (clean[j] && graph[i][j] == 1) {
union(i, j);
}
}
}
int[] cnt = new int[n];
Map<Integer, Set<Integer>> mp = new HashMap<>();
for (int i : initial) {
Set<Integer> s = new HashSet<>();
for (int j = 0; j < n; ++j) {
if (clean[j] && graph[i][j] == 1) {
s.add(find(j));
}
}
for (int root : s) {
cnt[root] += 1;
}
mp.put(i, s);
}
int mx = -1;
int ans = 0;
for (Map.Entry<Integer, Set<Integer>> entry : mp.entrySet()) {
int i = entry.getKey();
int t = 0;
for (int root : entry.getValue()) {
if (cnt[root] == 1) {
t += size[root];
}
}
if (mx < t || (mx == t && i < ans)) {
mx = t;
ans = i;
}
}
return ans;
}
private int find(int x) {
if (p[x] != x) {
p[x] = find(p[x]);
}
return p[x];
}
private void union(int a, int b) {
int pa = find(a);
int pb = find(b);
if (pa != pb) {
size[pb] += size[pa];
p[pa] = pb;
}
}
}
class Solution {
public:
vector<int> p;
vector<int> size;
int minMalwareSpread(vector<vector<int>>& graph, vector<int>& initial) {
int n = graph.size();
p.resize(n);
size.resize(n);
for (int i = 0; i < n; ++i) p[i] = i;
fill(size.begin(), size.end(), 1);
vector<bool> clean(n, true);
for (int i : initial) clean[i] = false;
for (int i = 0; i < n; ++i) {
if (!clean[i]) continue;
for (int j = i + 1; j < n; ++j)
if (clean[j] && graph[i][j] == 1) merge(i, j);
}
vector<int> cnt(n, 0);
unordered_map<int, unordered_set<int>> mp;
for (int i : initial) {
unordered_set<int> s;
for (int j = 0; j < n; ++j)
if (clean[j] && graph[i][j] == 1) s.insert(find(j));
for (int e : s) ++cnt[e];
mp[i] = s;
}
int mx = -1, ans = 0;
for (auto& [i, s] : mp) {
int t = 0;
for (int root : s)
if (cnt[root] == 1)
t += size[root];
if (mx < t || (mx == t && i < ans)) {
mx = t;
ans = i;
}
}
return ans;
}
int find(int x) {
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
void merge(int a, int b) {
int pa = find(a), pb = find(b);
if (pa != pb) {
size[pb] += size[pa];
p[pa] = pb;
}
}
};
func minMalwareSpread(graph [][]int, initial []int) int {
n := len(graph)
p := make([]int, n)
size := make([]int, n)
clean := make([]bool, n)
for i := 0; i < n; i++ {
p[i], size[i], clean[i] = i, 1, true
}
for _, i := range initial {
clean[i] = false
}
var find func(x int) int
find = func(x int) int {
if p[x] != x {
p[x] = find(p[x])
}
return p[x]
}
union := func(a, b int) {
pa, pb := find(a), find(b)
if pa != pb {
size[pb] += size[pa]
p[pa] = pb
}
}
for i := 0; i < n; i++ {
if !clean[i] {
continue
}
for j := i + 1; j < n; j++ {
if clean[j] && graph[i][j] == 1 {
union(i, j)
}
}
}
cnt := make([]int, n)
mp := make(map[int]map[int]bool)
for _, i := range initial {
s := make(map[int]bool)
for j := 0; j < n; j++ {
if clean[j] && graph[i][j] == 1 {
s[find(j)] = true
}
}
for root, _ := range s {
cnt[root]++
}
mp[i] = s
}
mx, ans := -1, 0
for i, s := range mp {
t := 0
for root, _ := range s {
if cnt[root] == 1 {
t += size[root]
}
}
if mx < t || (mx == t && i < ans) {
mx, ans = t, i
}
}
return ans
}
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。