514. Freedom Trail

514. Freedom Trail

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]:
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].
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.

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:
Length of both ring and key will be in range 1 to 100.
There are only lowercase letters in both strings and might be some duplcate characters in both strings.
It’s guaranteed that string key could always be spelled by rotating the string ring.
题目大意：
我们有一个原盘，上面写着字母，我们需要转动原盘来拼出我们需要的单词

思路：
这是一道动态规划+搜索的问题
首先我们需要记录每一个字母所对应的坐标，维护一个map，key是字母，而值是有这些字母所在坐标组成的数组。
每当需要读取一个字母时，我们可以通过遍历map中字幕所在的所有index。
dp[i][it]表示拼写i个字母，并用到it所在的字母时，所需要的最少的步数
当然在转动轮盘的时候即可以顺时针旋转也可以逆时针旋转。
顺时针旋转时是(start - next + size)%size 相反如果是逆时针则是（next - start +size)%size

class Solution {
public:
    int findRotateSteps(string ring, string key) {
    int size = ring.size();
    int ksize = key.size();
    unordered_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));// initializing dp vector 
    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 (auto it : mp[key[i - 1]]) {
            for (auto s : tmp) {
                int minDist = min((s + size - it) % size, (it + size - s) % size) + dp[i - 1][s];
                dp[i][it] = min(dp[i][it], minDist);
            }
        }
        tmp = mp[key[i - 1]];
    }
    for(auto re :dp[ksize]){
        res = min(res,re);
    }
    return res + ksize;
}
};