搜索
文章平均质量分 68
_TCgogogo_
这个作者很懒,什么都没留下…
展开
-
LeetCode 515 Find Largest Value in Each Tree Row (BFS)
Given therootof a binary tree, returnan array of the largest value in each rowof the tree(0-indexed).Example 1:Input: root = [1,3,2,5,3,null,9]Output: [1,3,9]Example 2:Input: root = [1,2,3]Output: [1,3]Example 3:Input: root ...原创 2021-06-02 22:55:22 · 93 阅读 · 0 评论 -
LeetCode 1367 Linked List in Binary Tree (dfs)
Given a binary treerootand alinked list withheadas the first node.Return True if all the elements in the linked list starting from theheadcorrespond to somedownward pathconnected in the binary treeotherwise return False.In this context downw...原创 2021-06-01 13:40:31 · 106 阅读 · 1 评论 -
LeetCode 576 Out of Boundary Paths (记忆化搜索)
There is anm x ngrid with a ball. The ball is initially at the position[startRow, startColumn]. You are allowed to move the ball to one of the four adjacent four cells in the grid (possibly out of the grid crossing the grid boundary). You can applyat m...原创 2021-05-31 13:15:11 · 176 阅读 · 0 评论 -
HDU 1495 非常可乐 (BFS)
HDU 1495 非常可乐 (BFS)原创 2015-09-21 22:57:57 · 727 阅读 · 0 评论 -
POJ 1184 聪明的打字员 (BFS + 剪枝)
聪明的打字员原创 2015-11-06 17:08:38 · 1755 阅读 · 2 评论 -
HDU 5527 Too Rich (好题 贪心 DFS)
HDU 5527 Too Rich (贪心 DFS)原创 2015-11-04 11:36:49 · 2340 阅读 · 1 评论 -
HDU 5438 Ponds (拓扑排序应用+DFS)
HDU 5438 Ponds (拓扑排序应用+DFS)原创 2015-09-15 12:16:51 · 998 阅读 · 0 评论 -
BZOJ 1053 反素数ant (DFS 反素数)
BZOJ 1053 反素数ant (DFS 反素数)原创 2015-09-09 17:31:34 · 677 阅读 · 0 评论 -
NOJ 1203 最多约数问题 (算数基本定理 DFS +剪枝)
最多约数问题 时间限制(普通/Java) : 20000 MS/ 30000 MS 运行内存限制 : 81920 KByte题目描述 正整数x的约数是能整除x的正整数。正整数x的约数个数记为div(x)。例如,1,2,5,10都是正整数10原创 2015-02-10 09:04:07 · 2948 阅读 · 2 评论 -
HDU 5305 Friends (DFS)
HDU 5305 Friends (DFS)原创 2015-07-23 19:39:23 · 2573 阅读 · 3 评论 -
hihocoder 1192 简单的树嵌入 (树上DFS 构造 好题)
hihocoder 1192 简单的树嵌入 (树上DFS 构造 好题)原创 2015-07-28 23:44:32 · 1079 阅读 · 0 评论 -
POJ 1129 Channel Allocation (四色定理+DFS)
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12678 Accepted: 6498DescriptionWhen a radio station is broadcasting over a very la原创 2015-02-10 09:14:42 · 1069 阅读 · 0 评论 -
POJ 2192 && HDU 1501 Zipper (记忆化搜索)
ZipperTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16803 Accepted: 5994DescriptionGiven three strings, you are to determine whether the third string原创 2015-07-07 14:47:03 · 892 阅读 · 0 评论 -
CSUOJ 1600 Twenty-four point (判断24点,另附给出表达式版)
CSUOJ 1600 Twenty-four point (判断24点,另附给出表达式版)原创 2015-05-07 09:35:30 · 1447 阅读 · 0 评论 -
acdream 1726 A Math game (部分和问题 DFS剪枝)
acdream 1726 A Math game (DFS剪枝)原创 2015-05-12 00:04:19 · 1374 阅读 · 0 评论 -
HDU 1142 A Walk Through the Forest (Dijkstra + 记忆化搜索 好题)
HDU 1142 A Walk Through the Forest (Dijkstra + 记忆化搜索 好题)原创 2015-04-25 22:31:26 · 1449 阅读 · 0 评论 -
POJ 3764 The xor-longest Path (01字典树 + DFS)
POJ 3764 The xor-longest Path (01字典树 + DFS)原创 2015-11-14 19:11:46 · 792 阅读 · 0 评论 -
[Offer收割]编程练习赛1 hihocoder 1268 九宫 (DFS)
[Offer收割]编程练习赛1 hihocoder 1268 九宫 (DFS)原创 2016-03-07 19:52:55 · 953 阅读 · 0 评论 -
hihocoder 1041 国庆出游 (DFS + bitset 好题)
hihocoder 1041 国庆出游 (DFS + bitset 好题)原创 2016-03-19 16:31:07 · 1557 阅读 · 0 评论 -
LeetCode 44 Wildcard Matching (通配符匹配 记忆化搜索 剪枝 推荐)
Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the...原创 2019-04-01 14:03:46 · 318 阅读 · 0 评论 -
LeetCode 10 Regular Expression Matching (正则匹配 记忆化搜索 推荐)
Given an input string (s) and a pattern (p), implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element....原创 2019-04-01 00:24:16 · 252 阅读 · 0 评论 -
LeetCode 816 Ambiguous Coordinates (DFS)
We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)". Then, we removed all commas, decimal points, and spaces, and ended up with the string S. Return a list of strings representing all...原创 2019-02-26 21:20:37 · 356 阅读 · 0 评论 -
LeetCode 22 Generate Parentheses (DFS 构造)
LeetCode 22 Generate Parentheses (DFS 构造)原创 2017-07-08 13:22:14 · 682 阅读 · 0 评论 -
LeetCode 529 Minesweeper (BFS)
529 Minesweeper (BFS)原创 2017-07-04 18:55:07 · 660 阅读 · 0 评论 -
LeetCode 301 Remove Invalid Parentheses (BFS + 剪枝)
LeetCode 301 Remove Invalid Parentheses (BFS + 剪枝)原创 2016-10-08 09:39:00 · 1267 阅读 · 0 评论 -
LeetCode 329 Longest Increasing Path in a Matrix (记忆化搜索)
LeetCode 329 Longest Increasing Path in a Matrix (记忆化搜索)原创 2016-09-24 14:28:33 · 1194 阅读 · 0 评论 -
LeetCode 140 Word Break II (DFS 分词方法 推荐)
LeetCode 140 Word Break II (DFS 分词方法 推荐)原创 2016-09-16 15:40:06 · 1768 阅读 · 0 评论 -
HDU 5696 区间的价值 (DFS)
HDU 5696 区间的价值 (DFS)原创 2016-05-22 22:20:22 · 1327 阅读 · 1 评论 -
FZU 2235 国王的出游 (离散化 + BFS)
FZU 2235 国王的出游 (离散化 + BFS)原创 2016-06-02 14:55:05 · 1096 阅读 · 0 评论 -
FZU 2227 邮票 (DFS+ 离散化 水题)
FZU 2227 邮票 (DFS+ 离散化 水题)原创 2016-04-17 20:45:11 · 756 阅读 · 0 评论 -
[Offer收割]编程练习赛2 hihocoder 1272 买零食 (DFS 或 dp 水题)
[Offer收割]编程练习赛2 hihocoder 1272 买零食 (DFS 或 dp 水题)原创 2016-03-14 10:33:46 · 1548 阅读 · 2 评论 -
[Offer收割]编程练习赛2 hihocoder 1273 (DFS + 状压)
[Offer收割]编程练习赛1 hihocoder 1273 (DFS + 状压)原创 2016-03-14 10:40:05 · 1146 阅读 · 0 评论 -
POJ 2704 && HDU 1208 Pascal's Travels (基础记忆化搜索)
Pascal's TravelsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 5328 Accepted: 2396 DescriptionAn n x n game board is populated with integers, one nonnegative ...原创 2015-04-25 21:35:59 · 1421 阅读 · 6 评论 -
POJ 3249 Test for Job (记忆化搜索 好题)
POJ 3249 Test for Job (记忆化搜索 好题)原创 2015-04-25 20:27:42 · 1092 阅读 · 0 评论 -
HDU 5025 Saving Tang Monk (复杂BFS)
Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 48 Accepted Submission(s): 16Problem Description《Journey to原创 2014-09-20 18:02:50 · 2290 阅读 · 0 评论 -
POJ 2449 Remmarguts' Date (第k短路 A*搜索算法模板)
POJ 2449 Remmarguts' Date (第k短路 A*搜索算法模板)原创 2015-03-17 23:57:33 · 1521 阅读 · 0 评论 -
POJ 2362 Square (DFS +剪枝)
Square原创 2014-08-09 21:01:11 · 1043 阅读 · 0 评论 -
HDU 5202 Rikka with string (水DFS)
HDU 5202 Rikka with string (水DFS)原创 2015-04-15 15:23:02 · 1093 阅读 · 0 评论 -
NOJ 1793 简单的迷宫 (裸BFS 经典)
简单的迷宫时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte总提交:27 测试通过:12描述睁开眼睛,Bob发现自己被困在一个迷宫里了,是做梦么…不管那么多了,还是先离开为妙。不过由于恐惧,Bob希望找到一条从入口到出口的最短路径,你能帮帮他么?这个迷宫相当简单,它是一个N*M的原创 2014-08-09 09:27:38 · 1567 阅读 · 2 评论 -
HDU 1175 连连看 (DFS +剪枝)
连连看 阐述为什么不能bfs做,吐血ac原创 2014-08-14 16:46:43 · 1363 阅读 · 0 评论