514. Freedom Trail Hard

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.

思路：本题明显使用动态规划可以避免重复子问题的计算从而减少时间开销。 需要求出来的是转到每一个字符所需要的最少转数，将这些最小转数加起来就得到想要的结果。通过匹配的方法，从key中一一取出一个字符，在ring中匹配，得到转到该字符的最小转数。注意，除了第一个字符外，剩下的字符的转数需要由上一个字符的转数加上转动次数决定。本题需要考虑的是当出现了顺、逆时针转动时都有相同转数的匹配，这是应该选择顺时针还是逆时针，这里需要将两种结果与下一个匹配的结果相加进行比较来选择。结尾的+key.length()是因为选中后需要按button，每次按button算一次步骤。

class Solution {
public:
    int findRotateSteps(string ring, string key) {
        int result[key.length()][ring.length()];
        int answer = INT_MAX;
        for (int i = 0; i < key.length(); i++) {
            for (int j = 0; j < ring.length(); j++) {
                result[i][j] = INT_MAX;
            }
        }
        
        for (int i = 0; i < key.length(); i++) {
             for (int j = 0; j < ring.length(); j++) {
                 if (key[i] == ring[j]) {
                     if (i == 0)
                        result[i][j] = min(abs(i - j), (int)ring.length() - abs(i - j));
                     if (i != 0)
                    for (int k = 0; k < ring.length(); k++) {
                        if (result[i - 1][k] != INT_MAX) {
                            result[i][j] = min(result[i][j], result[i - 1][k] + min(abs(k - j), (int)ring.length() - abs(k - j)));
                            if (i == key.length() - 1 && answer > result[i][j]) {
                                answer = result[i][j];
                            }
                        }
                    }
                 }
             }
        }
        return answer + key.length();
    }
};