Word Puzzles（字典树）

最新推荐文章于 2021-04-22 22:23:31 发布
最新推荐文章于 2021-04-22 22:23:31 发布
阅读量2.2k 收藏
点赞数
CC 4.0 BY-SA版权
分类专栏： 字典树 解题报告 ===数据结构=== 文章标签： 字典树
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/userluoxuan/article/details/38439545
本文介绍了一种使用字典树解决Word Puzzles问题的方法。通过为单词建立字典树，并在单词末尾记录编号，然后进行全图暴力搜索，从每个节点出发，探索八个方向以找到匹配的单词。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

Description

Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possibly with the intent to minimise their client's perception of any possible delay in bringing them their order. 

Even though word puzzles may be entertaining to solve by hand, they may become boring when they get very large. Computers do not yet get bored in solving tasks, therefore we thought you could devise a program to speedup (hopefully!) solution finding in such puzzles. 

The following figure illustrates the PizzaHut puzzle. The names of the pizzas to be found in the puzzle are: MARGARITA, ALEMA, BARBECUE, TROPICAL, SUPREMA, LOUISIANA, CHEESEHAM, EUROPA, HAVAIANA, CAMPONESA. 

Your task is to produce a program that given the word puzzle and words to be found in the puzzle
最低0.47元/天 解锁文章

200万优质内容无限畅学
『杭电1857』Word Puzzle
漠宸离若的博客
10-27 288
Problem Description Did you heard of a little game named "Word Puzzle" ? If you didn't, what a pity ! In the game, you will be given a rectangular grid of letters, in which several words are hidden. Each word may begin anywhere in the puzzle, and may be
【2025年华为OD机试】(E卷,100分)-猜字谜 （JavaScript&Java & Python&C/C++）
嵌入式技术开发
02-17 721
华为OD（Outsourcing Developer，外包开发工程师）是华为针对软件开发工程师岗位的一种招聘形式，主要包括笔试、技术面试以及综合面试等环节。尤其在笔试部分，算法题的机试至关重要。
【字典树】 poj1204 Word Puzzles
Ted's 游乐园
08-04 2850
Word Puzzles http://poj.org/problem?id=1204 Description Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using tab
Word Puzzles （AC自动机）
永夜莫明的博客
08-20 1937
https://cn.vjudge.net/problem/POJ-1204 Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles...
Word Puzzles
majcos的专栏
05-14 5646
DescriptionWord puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possibly wi
数据结构与算法-HashSet和HashMap专题
Bushroom Farmer
04-11 73
目录 HashSet和HashMap 理论知识 扩展：Bloom过滤器 扩展：Hash树 应用实例 四数和 (leetcode #18) 和为K的子数组 (leetcode #560) 从链表中删去总和值为零的连续节点 (leetcode #1171) 和可被 K 整除的子数组 (leetcode #974) 连续的子数组和 (leetcode #523) 元素和为目标值的子...
（十三：2020.08.28）CVPR 2015 追踪之论文纲要（译）
Jojo论文基地
08-28 3130
CVPR 2020 追踪之论文纲要（修正于2020.08.27）讲在前面论文目录 讲在前面 论坛很多博客都对论文做了总结和分类，但就医学领域而言，对这些论文的筛选信息显然需要更加精细的把控，所以自己对这602篇的论文做一个大致从名称上的筛选，希望能找到些能解决当前问题的答案。 论文链接建议直接Google论文名，比去各种论文或顶会网站找不知道快捷多少。 下面皆为机器翻译以方便我第一次筛选，我会慢慢修正，但现在请结合。有兴趣的可以问我要处理这些论文并自动翻译的脚本。 Respect！ 论文目录
POJ1204：Word Puzzles——题解
weixin_34148340的博客
12-05 164
http://poj.org/problem?id=1204 题目大意：给一个字母表，求一些字符串的开端第一次出现的位置和字符串的方向（字符串可以按照八个方向放在字母表中可匹配的位置） ———————————————————————————————— 一定是AC自动机，而且我们不可能对二位字母表AC一下，所以我们要把待匹配串AC一下，然后枚举字母表的起点（不要枚举多了），ACcheck一下就...
word-puzzle:这是一个单词搜索生成器，但是在将单词添加到2D数组时遇到了麻烦
05-15
字谜 这是一个单词搜索生成器，但是在将单词添加到2D数组时遇到了麻烦。 我有一个检查方法，以查看是否可以将单词放置在2d数组中，但是由于某些原因它不起作用。 我不知道我在做什么错。 如果您发现我的错误或对改进此程序有任何建议，请给我发电子邮件 。 谢谢。 享受。
趣学Python编程 书中源代码
07-17
Chapter 2 Magic coins example. magic_coins1.py Chapter 3 Favourite sports. favourite_sports.py Furniture placeholder. furniture_placeholder.py A list of lists. list_of_lists.py A letter from Malcolm Dithering dithering_letter.py Escaping quotes quote_escaping.py The Wizard List wizard_list.py Chapter 4 The turtle draws a square. turtle1.py The turtle draws two parallel lines. turtle2.py Chapter 5 If statements if_statements.py Conditions in if-statements. conditions.py Else-if (elif) statements. elif_statements.py Strings and numbers. strings_and_numbers.py Chapter 6 Five Hellos. five_hellos.py Huge hairy pants (example 1). huge_hairy_pants1.py Huge hairy pants (example 2). huge_hairy_pants2.py Magic coins (example 2). magic_coins2.py A while-loop with multiple conditions. while_loop_multiple_conditions.py Looping through the wizard list. wizard_list_loop.py Chapter 7 A function to calculate your savings. savings.py Building a spaceship. spaceship_building.py Test function (example 1). test_function1.py Test function (example 2). test_function2.py Your age function. your_age.py Chapter 8 Giraffes (example 1). giraffes1.py Giraffes (example 2). giraffes2.py Three turtles. three_turtles.py Chapter 9 Using the abs (absolute) function. abs_function.py Using the exec (execute) function. exec_function.py Using the len (length) function. len_function.py Using the max and min functions. max_and_min.py Using the range function. range_function.py Using the sum function. range_function.py Opening a file. opening_a_file.py Writing to a file. writing_to_a_file.py Chapter 10 Copying objects (example 1). copying_objects1.py Copying objects (example 2). copying_objects1.py Guess a random number. guess_a_number.py Random desserts. random_desserts.py Using the time module. timing_lots_of_numbers.py Using pickle to save information. pickle_saving.py Using pickle to load information. pickle_loading.py Chapter 11 Drawing an eight point star. eight_point_star.py Drawing a many point star. many_point_star.py Drawing a spiral star. spiral_star.py Drawing a nine point star. nine_point_star.py Drawing a car. car.py Drawing a yellow circle. yellow_circle.py Drawing a filled green circle. green_circle.py Drawing a dark-green circle. dark_green_circle.py Drawing squares using a function. square_function.py Drawing filled and unfilled squares. filled_squares.py Drawing stars using a function. star_function.py Chapter 12 Clickable button (example 1). clickable_button1.py Clickable button (example 2). clickable_button2.py Drawing a diagonal line. diagonal_line.py Drawing a square. square.py Drawing a horizontal rectangle. horizonal_rectangle.py Drawing a vertical rectangle. horizonal_rectangle.py Drawing random rectangles. random_rectangles.py Drawing coloured rectangles. coloured_rectangles.py Using the color chooser. rectangle_colorchooser.py Drawing arcs. drawing_arcs.py Drawing polygons. drawing_polygons.py Drawing text. drawing_text.py Drawing images. drawing_images.py Basic animation (example 1). basic_animation1.py Basic animation (example 2). basic_animation2.py Using events (example 1). using_events1.py Using events (example 2). using_events1.py Using the move function. using_move.py Using the itemconfig function. using_itemconfig.py Chapter 13 Bounce (example 1) - this one doesn't do anything when it's run. bounce1.py Bounce (example 2) - stationary ball. bounce2.py Bounce (example 3) - ball moving upwards. bounce3.py Bounce (example 4) - ball moving up and down. bounce4.py Bounce (example 5) - ball moving around the screen. bounce5.py Chapter 14 Bounce (example 6) - adding the paddle. bounce6.py Bounce (example 7) - moving paddle. bounce6.py Bounce (example 8) - bouncing the ball when it hits the paddle. bounce6.py Bounce (example 9) - ending the game when the ball hits the floor. bounce6.py Chapter 15 Transparent Image - 27 by 30 pixels. transparent-image.gif 6 Stick Figure Images - left and right. stickfigure.zip 3 Platform images. platform.zip 2 Door images. door.zip Background image. background.gif Chapter 16 Stickman Game, version 1 - displaying the background. stickmangame1.py Stickman Game, version 2 - adding the within functions. stickmangame2.py Stickman Game, version 3 - adding the platform. stickmangame3.py Stickman Game, version 4 - adding lots of platforms. stickmangame4.py Chapter 17 Stick figure sprite class. stickfiguresprite.py Stickman Game, version 5 - adding the stick figure. stickmangame5.py Chapter 18 Stickman Game, version 6 - animating the stick figure. stickmangame6.py Stickman Game, version 6 - adding the door sprite. stickmangame7.py Afterword Pygame2 example. pygame-example.py Hello World Java example. HelloWorld.java Hello World C example. helloworld.c Hello World C++ example. helloworld.cpp Hello World C# example. helloworld.cs Hello World PHP example. helloworld.php Hello World Objective-C example. helloworld.m Hello World Perl example. helloworld.pl Hello World Ruby example. helloworld.rb Hello World Javascript example. helloworld.js Hello World Javascript Browser example. helloworld-js.html
HDU 1875 Word Puzzle
D_Double's Journey
10-26 1612
链接： http://acm.hdu.edu.cn/showproblem.php?pid=1857 题目： Word Puzzle Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 427    Accept
解题报告（6）——Word puzzles
scarlyw的博客
11-07 1215
Word Puzzle 题目描述 给出一个字母地图和一些字符串，请你找出每个字符串的第一个字母在地图中的位置和该字符串的方向。 假设地图左上角为原点（0,0）。可能的方向有8个，从北开始顺时针方向依次编号A～H，北方编号为“A”。                （方向） 输入格式 第一行包含三个正整数：L（0＜L≤1000），C（0＜C≤1000），W（0＜W≤1000
1204--Word Puzzles
whilt_hand的博客
04-22 555
1204–Word Puzzles 链接 题意： 给一个L*C的字符矩阵，然后w个单词，要求每个单词在字符矩阵中首次出现的位置和方向。 分析： 将代求单词建立字典树，利用AC自动机。从字符矩阵中遍历各个方向和起点查找，起点只需从矩阵四条边开始就行，因为从边界出发总能覆盖到每条边。 code: #include <iostream> #include <string> #include <set> #include<queue> #include<stdi
poj 1204 Word Puzzles 给出一个N*L的字符矩阵，再给出M个字符串，问这M个字符串在这个字符矩阵中出现的位置 Tire树
kongming_acm的专栏
04-22 664
<br /><br />DescriptionWord puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company s
trie学习 poj1204 Word Puzzles
我是一颗小星星~
10-08 969
Word Puzzles Time Limit: 5000MS   Memory Limit: 65536K     Accepted: 3622   Special Judge Description Word puzzles are usually simple and very entertaining for all ages.
Word Puzzle Tri树
qq_41703679的博客
08-15 363
Word Puzzle Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 886    Accepted Submission(s): 226   Problem Description Did you heard of a litt...
【AC自动机 / trie树】G - Word Puzzles POJ - 1204
wldcmzy的博客
07-31 361
题目描述 Word puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possibly with the intent to minimise their client’s perception of any pos
15puzzles
最新发布
03-25
### 关于15 Puzzle的游戏与算法实现 #### 什么是15 Puzzle？ 15 Puzzle 是一种经典的滑动拼图游戏，通常由一个4×4的网格组成，其中包含15个编号方块和一个空白区域。目标是通过移动相邻的方块到空白位置来重新排列方块至特定的目标状态。 #### 实现思路 为了实现15 Puzzle 游戏及其求解算法，可以采用以下几种技术： 1. **表示棋盘的状态** 使用二维数组来存储当前棋盘的状态是一种常见的做法[^2]。例如： ```java int[][] board = new int[4][4]; ``` 2. **定义合法操作** 需要找到空白格的位置并允许上下左右四个方向上的有效移动。可以通过遍历二维数组定位空白格索引，并判断其周围是否有可交换的方块。 3. **启发式搜索算法** 常见的解决方法包括广度优先搜索(BFS) 和 A* 搜索算法。A* 算法利用了曼哈顿距离(Manhattan Distance)[^1] 或者汉明距离(Hamming Distance)，作为评估函数的一部分，从而更高效地探索可能的路径。 - 曼哈顿距离计算方式如下： 对于任意两个坐标 `(x1, y1)` 和 `(x2, y2)`， \[ d_{\text{manhattan}} = |x_1-x_2| + |y_1-y_2| \] - 汉明距离则简单统计不在正确位置上的方块数量。 4. **代码示例** 下面是一个简单的 Java 类 `Board` 来描述如何初始化以及计算曼哈顿距离的方法片段： ```java public class Board { private final int[][] tiles; public Board(int[][] tiles) { this.tiles = copyTiles(tiles); } // 计算曼哈顿距离 public int manhattan() { int distance = 0; for (int i = 0; i < size(); i++) { for (int j = 0; j < size(); j++) { if (tiles[i][j] != 0 && !isCorrectPosition(i, j)) { Point goalPos = getGoalPosition(tiles[i][j]); distance += Math.abs(goalPos.x - i) + Math.abs(goalPos.y - j); } } } return distance; } private boolean isCorrectPosition(int row, int col){ int value = tiles[row][col]; if(value == 0) return true; int expectedRow = (value - 1)/size(); int expectedCol = (value - 1)%size(); return row == expectedRow && col == expectedCol; } private Point getGoalPosition(int tileValue){ int targetX = (tileValue - 1)/size(); int targetY = (tileValue - 1)%size(); return new Point(targetX,targetY); } private static class Point{ int x,y; Point(int x,int y){this.x=x;this.y=y;} } private int[][] copyTiles(int[][] original){ int N=original.length; int [][] result=new int[N][N]; for(int i=0;i<N;i++) System.arraycopy(original[i],0,result[i],0,N); return result; } public int size(){ return tiles.length; } } ``` #### 可能遇到的技术难点 - 如何有效地管理邻居节点？这涉及到返回一组迭代器对象的问题，正如在参考资料中提到的一样，任何实现了 Iterable 接口的数据结构都可以被用来保存这些邻接关系。 - 数据编码问题：如果涉及多张图像或者复杂文件格式处理，则需要注意特殊字符序列如 `[FF] XOR [XX]` 这样的转换逻辑[^3]。 #### 总结 综上所述，构建一个完整的15 Puzzle 应用程序不仅需要良好的数据结构设计能力，还需要掌握一定的图形界面开发技巧以及优化搜索策略的知识点。上述内容提供了基础框架指导，具体细节还需依据实际需求进一步完善。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值