[Leetcode] 514. Freedom Trail 解题报告

魔豆Magicbean

于 2017-12-08 11:55:41 发布

阅读量482

点赞数

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Dynamic Programming DFS

本文链接：https://blog.csdn.net/magicbean2/article/details/78748843

版权

该博客详细介绍了Leetcode中的514题——'Freedom Trail'的解题过程。玩家需旋转金属圆盘以拼写出特定关键词来解锁门。博主分析了题意，提出将问题转化为动态规划（DP）问题，以找到拼写所有关键字字符所需的最小步数。定义了dp[i][j]表示拼写到key的第i个字符，终点为第j个候选字符的最短路径，并给出了递推公式。通过滚动数组进一步优化空间复杂度，最后展示了代码实现。

摘要由CSDN通过智能技术生成

题目：

In the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring", and use the dial to spell a specific keyword in order to open the door.

Given a string ring, which represents the code engraved on the outer ring and another string key, which represents the keyword needs to be spelled. You need to find the minimum number of steps in order to spell all the characters in the keyword.

Initially, the first character of the ring is aligned at 12:00 direction. You need to spell all the characters in the string key one by one by rotating the ring c