文件: root - text - article - 2019 - 10 - find-cycles-in-a-graph.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 538 次阅读, 22471 次搜索 | 72 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 538 次阅读, 22471 次搜索 | 72 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Facebook:
Given an undirected graph, determine if a cycle exists in the graph.
Here is a function signature:
Can you solve this in linear time, linear space?
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 538 次阅读, 22471 次搜索 | 72 个单词 Given an undirected graph, determine if a cycle exists in the graph.
Here is a function signature:
def find_cycle(graph):
# Fill this in.
graph = {
'a': {'a2':{}, 'a3':{} },
'b': {'b2':{}},
'c': {}
}
print find_cycle(graph)
# False
graph['c'] = graph
print find_cycle(graph)
# True
Can you solve this in linear time, linear space?
猜您喜欢...
- Daily Interview Problem: Tree Serialization
- Daily Interview Problem: Jump to the End
- Daily Interview Problem: First Missing Positive Integer
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- Absolute Path
- Invert a Binary Tree
- [Daily Problem] Angles of a Clock
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Daily Interview Problem: 3 Sum
©2006~2024 牛排过熟 - 0.00897 秒 - 5995.275 KB/s - 79 在线 内存: 528.79 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。