leetcode 924. Minimize Malware Spread

最新推荐文章于 2026-05-01 06:53:43 发布

原创最新推荐文章于 2026-05-01 06:53:43 发布 · 215 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode 同时被 2 个专栏收录

155 篇文章

订阅专栏

广度优先搜索

9 篇文章

订阅专栏

网络中节点间如果直接连接，其中一个节点被恶意软件感染，则两个节点都会被感染。给出初始感染节点，预测移除哪个节点能最小化最终的感染数量。

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. 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.

Note that if a node was removed from the initial list of infected nodes, it may still be infected later as a result of the malware spread.

Example 1:

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

Example 2:

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

Example 3:

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

Note:

1 < graph.length = graph[0].length <= 300
0 <= graph[i][j] == graph[j][i] <= 1
graph[i][i] = 1
1 <= initial.length < graph.length
0 <= initial[i] < graph.length

LeetCode最全代码

04-09