dfs
love music.
中山大学计算机博士在读,曾就职于腾讯等公司,目前从事AI多模态大模型研究。
展开
-
PAT甲级 1053. Path of Equal Weight DFS,树的遍历记录路径
1053 Path of Equal Weight (30 分) Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights o...原创 2018-09-13 15:39:29 · 178 阅读 · 0 评论 -
leetcode 17. 电话号码的字母组合(dfs)
给定一个仅包含数字2-9的字符串,返回所有它能表示的字母组合。 给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。 示例: 输入:"23" 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. 解析:用DFS即可轻松解决。 class Solution { map<char,strin...原创 2019-08-14 12:55:41 · 358 阅读 · 0 评论 -
PAT甲级 1111 Online Map (30 分)dijkstra + dfs
1111 Online Map (30 分) Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is the shortest, and the other...原创 2019-01-02 19:47:01 · 322 阅读 · 0 评论 -
PAT甲级 1110 Complete Binary Tree (25 分)完全二叉树、dfs
1110 Complete Binary Tree (25 分) Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, the first line g...原创 2018-11-29 10:32:23 · 175 阅读 · 0 评论 -
PAT甲级 1106 Lowest Price in Supply Chain (25 分)dfs
1106 Lowest Price in Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer. Start...原创 2018-11-24 17:35:31 · 177 阅读 · 0 评论 -
PAT甲级 1102 Invert a Binary Tree (25 分)树的遍历(bfs+dfs)
1102 Invert a Binary Tree (25 分) The following is from Max Howell @twitter: Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so...原创 2018-11-20 18:20:59 · 164 阅读 · 0 评论 -
PAT甲级 1090 Highest Price in Supply Chain (25 分)dfs (树的遍历)
1090 Highest Price in Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer. Star...原创 2018-11-04 15:05:31 · 133 阅读 · 0 评论 -
PATj甲级 1087 All Roads Lead to Rome (30 分)dijkstra + dfs
1087 All Roads Lead to Rome (30 分) Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most hap...原创 2018-10-25 22:19:42 · 182 阅读 · 0 评论 -
PAT甲级 1079 Total Sales of Supply Chain (25 分)DFS
参考链接:https://www.cnblogs.com/grglym/p/7922417.html 1079 Total Sales of Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in...原创 2018-10-16 21:54:46 · 218 阅读 · 0 评论 -
1068 Find More Coins (30 分)
1068 Find More Coins (30 分) Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds o...原创 2018-09-29 22:13:04 · 541 阅读 · 0 评论 -
C++ 邻接链表进行图的创建、BFS、DFS、连通图数量
参考链接:https://blog.csdn.net/s634772208/article/details/45580333 图的创建采用邻接表的形式。 代码实现如下: #include<iostream> #include<queue> using namespace std; #define maxSize 100 int visited[maxSize] ...原创 2018-07-18 19:37:38 · 1570 阅读 · 0 评论 -
leetcode 22. 括号生成(dfs)
给出n代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合。 例如,给出n = 3,生成结果为: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] 题解:用DFS即可轻松解决。 class Solution { vector<string> res; public...原创 2019-08-14 13:19:57 · 137 阅读 · 0 评论