LeetCode每日一题(1466. Reorder Routes to Make All Paths Lead to the City Zero)

最新推荐文章于 2024-09-21 10:02:17 发布
最新推荐文章于 2024-09-21 10:02:17 发布
阅读量308 收藏
点赞数
文章标签： leetcode 算法 职场和发展
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/wangjun861205/article/details/129755327
版权
给定一棵树形结构的城市网络，去年所有道路都是单向的。今年首都城市0有大型活动，需要确保所有城市都能到达城市0。任务是重新定向一些道路，使得每个城市能到达城市0，返回最少需要改变的道路数。给定城市数量n和连接关系，返回最小的重新定向次数。例如，输入示例表示需要改变3条道路使所有城市可达城市0。
摘要由CSDN通过智能技术生成

There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). Last year, The ministry of transport decided to orient the roads in one direction because they are too narrow.

Roads are represented by connections where connections[i] = [ai, bi] represents a road from city ai to city bi.

This year, there will be a big event in the capital (city 0), and many people want to travel to this city.

Your task consists of reorienting some roads such that each city can visit the city 0. Return the minimum number of edges changed.

It’s guaranteed that each city can reach city 0 after reorder.

Example 1:

Input: n = 6, connections = [[0,1],[1,3],[2,3],[4,0],[4,5]]
Output: 3

Explanation: Change the direction of edges show in red such that each node can reach the node 0 (capital).

Example 2:

Input: n = 5, connections = [[1,0],[1,2],[3,2],[3,4]]
Output: 2

Explanation: Change the direction of edges show in red such that each node can reach the node 0 (capital).

Example 3:

Input: n = 3, connections = [[1,0],[2,0]]
Output: 0

Constraints:

  • 2 <= n <= 5 * 104
  • connections.length == n - 1
  • connections[i].length == 2
  • 0 <= ai, bi <= n - 1
  • ai != bi

这题以前做过， 但是这次用以前的代码提交报超时了， 应该是添加了新的测试。

我们从 0 出发，bfs 遍历整棵树， 每个 edge 一定是有一条路跟它对应的， 但是路的方向可能不是朝向 0 的方向， 因为我们是从 0 出发的， 所以我们一路上遍历的路如果是跟我们的遍历方向相反的

最低0.47元/天 解锁文章
wangjun861205
关注
Leetcode 1466. Reorder Routes to Make All Paths Lead to the City Zero (python)
qq_37821701的博客
11-18 302
题目 解法： 这道题目有个关键是，图里面n个节点，有n-1条边，而且题目也提示了可以看作是一棵树。关键在于理解每个节点都指向0代表什么：代表的是每个以0作为根节点，每个叶节点到根节点的路径都是子节点指向父节点的。比如第一个例子，只需要保证2到0和5到0这两条路径都是子节点指向父节点的。而对于connections里面的边，一定是有一个在树里是父节点，另一个是子节点，我们只需要保证这两个节点的相对顺序即可，那么解法就很清晰了： 从0节点出发，利用BFS或者DFS遍历一遍树，并且保存每个节点被访问的相对顺序
1466. Reorder Routes to Make All Paths Lead to the City Zero
Young's Blog
09-06 153
https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/submissions/ There arencities numbered from0ton-1andn-1roads such thatthere is only one way to travel between twodifferent cities (this network form a tree)....
leetcode 1466. Reorder Routes to Make All Paths Lead to the City Zero（重新定向路线，使所有路径通向城市0）
蓝羽飞鸟的博客
03-24 118
有向图（正向，反向），DFS
LeetCode1466. Reorder Routes to Make All Paths Lead to the City Zero
MrJustin的博客
06-01 381
[Med] LeetCode 1466. Reorder Routes to Make All Paths Lead to the City Zero 链接: https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/ 题目描述： There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one
【LeetCode】1466. 重新规划路线 Reorder Routes to Make All Paths Lead to the City Zero (Python)
负雪明烛
06-07 2144
作者： 负雪明烛 id： fuxuemingzhu 个人博客：http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法DFSBFS日期 题目地址：https://leetcode-cn.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/ 题目描述 n 座城市，从 0 到 n-1 编号，其间共有 n-1 条路线。因此，要想在两座不同城市之间旅行只有唯一一条路线可供选择（路线网形成一颗.
Reorder Routes to Make All Paths Lead to the City Zero
leetcode 解题思路
05-31 222
There arencities numbered from0ton-1andn-1roads such thatthere is only one way to travel between twodifferent cities (this network form a tree).Last year,The ministry of transportdecided to orient the roads in one direction because they are to...
[leetcode] 1466. Reorder Routes to Make All Paths Lead to the City Zero
Learning from the mistakes
10-28 256
Description There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one way to travel between two different cities (this network form a tree). Last year, The ministry of transport decided to orient the roads in one direction because
LeetCode 1466. Reorder Routes to Make All Paths Lead to the City Zero？
Tech in Pieces
12-01 680
There are n cities numbered from 0 to n-1 and n-1 roads such that there is only one way to travel between two different cities (this network form a tree). Last year, The ministry of transport decided to orient the roads in one direction because they are to
LeetCode //C - 1466. Reorder Routes to Make All Paths Lead to the City Zero
Made in Code
01-26 883
【代码】LeetCode //C - 1466. Reorder Routes to Make All Paths Lead to the City Zero。
java-leetcode题解之 All Paths From Source to Target.java
09-15
java基础 java_leetcode题解之 All Paths From Source to Target.java
leetcode算法(每日一题).pdf
08-18
自己总结的leetcode新人必刷30题 含详细注解
leetcode每日一题在哪-crispy_leetcode:一个存储和分享我的leetcode解决方案的地方
06-30
每日一题在哪算法实践 我将在这里存储我提交的八月 LeetCode 挑战、LeetCode 和 HackerRank 问题。 更新：每日编码挑战 我计划每天至少解决 1 个 leetcode/hackerrank 问题。 我按类别组织了每个问题： 每月挑战 ...
java-leetcode题解之Bus Routes.java
09-20
java java_leetcode题解之Bus Routes.java
leetcode下载-LeetCode-3:LeetCode每日一题
06-29
leetcode下载 ...我们也欢迎你加入我所在的微信群，每日一题小组。 你的反馈，是我们最大的动力。如果你做一道题，觉得我们的代码很好，欢迎打赏和。 No. Problem Han Yin Note 001   002   003  
C++速通LeetCode中等第3题-盛最多水的容器
lyx的博客
09-18 315
双指针法：两个指针分别指向左右边界，记录最大面积，由于面积由短板决定，两个指针中较短的短指针向内移动一格，再次记录最大面积，直到两指针相遇，得出答案。
2024/9/21 leetcode 21.合并两个有序链表 2.两数相加
最新发布
su_xu_chao的博客
09-21 779
将两个升序链表合并为一个新的链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。[][0]l2。
力扣 16.最接近的三数之和
qq_51352130的博客
09-16 386
设 s=nums[i]+nums[j]+nums[k]，为了判断 s 是不是与 target 最近的数，我们还需要用一个变量 minDiff 维护 ∣s−target∣ 的最小值。分类讨论：如果 s=target，那么答案就是 s，直接返回 s。如果 s>target，那么如果 s−target<minDiff，说明找到了一个与 target 更近的数，更新 minDiff 为 s−target，更新答案为 s。然后和三数之和一样，把 k 减一。
Leetcode 470. 用 Rand7() 实现 Rand10()
qq_51350957的博客
09-18 1051
Leetcode 470. 用 Rand7() 实现 Rand10()
"LeetCode每日一题高频面试算法题目1：队列实现栈
eue.isEmpty()){  return null;  }  while(queue.size() > 1){  help.add(queue.poll());  } ... LeetCode每日一题高频面试算法题目1中的队列实现栈，为算法学习者提供了一个很好的训练机会。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值