【leetcode】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]:

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.

解题思路：记dp[i][j]为使ring中的第i个字符对应key的第j个字符需要操作的最少的次数，那么有 dp[i][j] = min (dp[k][j-1] + distance(i,k))， k表示ring中和key[j-1]相对应的字符，而distance(i,k) 表示ring中i与k的最短距离，因为ring中和key[j-1]相对应的字符可能有多个，所以需要求最小值。最后只要找出ring中与key最后一个字符相同的字符出现的所有位置，假设为m,取 min(dp[m][-1]）的最小值即可。

代码如下：

class Solution(object):
    def findRotateSteps(self, ring, key):
        """
        :type ring: str
        :type key: str
        :rtype: int
        """
        dp = [[float('inf')] * len(key) for _ in ring]

        for i in range(len(ring)):
            if ring[i] == key[0]:
                dp[i][0] = min(i,len(ring) - i) + 1
        for j in range(1,len(key)):
            for i in range(len(ring)):
                if key[j] == ring[i]:
                    for k in range(len(ring)):
                        #if i == k:continue
                        if ring[k] == key[j-1]:
                            diff = abs(k - i)
                            dp[i][j] = min(dp[i][j],dp[k][j-1] + min(diff,len(ring) - diff) + 1)
        res = float('inf')
        for i in range(len(ring)):
            if ring[i] == key[-1]:
                for j in range(len(dp[i])):
                    res = min(res,dp[i][-1])

        return res