514. Freedom Trail （Divide and Conquer）

题目：

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 clockwise or anticlockwise to make each character of the string  key  aligned at 12:00 direction and then by pressing the center button. 
At the stage of rotating the ring to spell the key character  key[i] :

1. You can rotate the ring clockwise or anticlockwise one place, which counts as 1 step. The final purpose of the rotation is to align one of the string ring's characters at the 12:00 direction, where this character must equal to the character key[i].
2. If the character key[i] has been aligned at the 12:00 direction, you need to press the center button to spell, which also counts as 1 step. After the pressing, you could begin to spell the next character in the key (next stage), otherwise, you've finished all the spelling.

Example:

Input: ring = "godding", key = "gd"
Output: 4
Explanation:
 For the first key character 'g', since it is already in place, we just need 1 step to spell this character. 
 For the second key character 'd', we need to rotate the ring "godding" anticlockwise by two steps to make it become "ddinggo".
 Also, we need 1 more step for spelling.
 So the final output is 4.

Note:

1. Length of both ring and key will be in range 1 to 100.
2. There are only lowercase letters in both strings and might be some duplcate characters in both strings.
3. It's guaranteed that string key could always be spelled by rotating the string ring.

翻译：

在视频游戏“辐射4”中，任务“自由之路”要求玩家到达一个名为“自由径环”的金属拨号盘，并使用表盘拼写特定的关键字以打开门。

给定一个字符串环，它代表刻在外环上的代码和另一个字符串键，代表关键字需要拼写。您需要找到最小步骤数，以拼写关键字中的所有字符。


最初，环的第一个字符在12:00方向对齐。您需要通过顺时针或逆时针旋转环来逐个拼写字符串键中的所有字符，使字符串键的每个字符在12:00方向对齐，然后按中间按钮。
在旋转环以拼写键字符键[i]的阶段：
您可以将环顺时针或逆时针旋转一个位置，计为1步。旋转的最终目的是将字符串环的字符之一在12:00方向对齐，其中该字符必须等于字符键[i]。
如果字符键[i]在12:00方向对齐，您需要按中心按钮拼写，这也计为1步。按下后，你可以开始拼写键中的下一个字符（下一个阶段），否则，你已经完成了所有的拼写。
例：




输入：ring =“godding”，key =“gd”
输出：4
说明：
 对于第一个关键字符'g'，因为它已经在位，我们只需要1步拼写这个字符。
 对于第二个关键字符'd'，我们需要旋转环“godding”逆时针两个步骤，使其成为“ddinggo”。
 此外，我们还需要1步拼写。
 所以最终输出是4。
注意：
环和键的长度将在1到100的范围内。
在两个字符串中只有小写字母，在两个字符串中可能有一些重复字符。

它保证字符串键可以总是通过旋转字符串环。

解题分析：

这道题用到了图论中求最短路径的算法，自我认为和分治并无多少关联。

解此题的过程中，我因为忽略了开始和结束可能会用两或多种相同的情况，导致某些测试通不过，

后来看解析才恍然大悟，原来另起始点和结束点距离每个key的起始和结束的距离为零即可 解决。

如下图的例子：

设

代码：

#include<iostream>
#include<string>
#include<map> 
#include<vector>
using namespace std;
 
class Solution {
public:
    int findRotateSteps(string ring, string key) {
    	
        int size = ring.size();
        int ksize = key.size();
        map<char,vector<int>> mp;
        for(int i=0;i<size;++i){
            mp[ring[i]].push_back(i);
        }
        
        vector<vector<int>> dp(ksize+1,vector<int> (size,INT_MAX));// 图 
        fill(dp[0].begin(),dp[0].end(),0);
        
        vector<int> tmp(1,0);/
        
        int res = INT_MAX;
        for(int i=1;i<=ksize;++i){
        	 for(int it = 0; it<mp[key[i-1]].size();it++){  
                for(int j=0;j<tmp.size();++j){  
                    int minDist = min((tmp[j] + size -mp[key[i-1]][it])%size,(mp[key[i-1]][it] + size - tmp[j])%size) + dp[i-1][tmp[j]];
                    dp[i][mp[key[i-1]][it]] =min(dp[i][mp[key[i-1]][it]],minDist);
                    res = (i!=ksize?res:min(res,dp[i][mp[key[i-1]][it]])); 
                }
            }

            tmp = mp[key[i-1]]; 
        }
        return res + ksize;
    }
};

int main() {
	
}

提交状态：