思路:首先想到的就是深度优先搜索,从ring[i]
顺时针到达key[j]
的路径和逆时针的路径都尝试一遍,最终肯定能得到最短路径,但肯定会超时,因为这个复杂度是幂级的,即每个点都有两种可能;
所以,需要对我们尝试过的路径作标注,m["i # j"]
即代表从ring[i]到key[j]
的最短路径;
比起动态规划还是差远了;
map<string, int> m;
int dfs(string ring, int x, string key, int y)
{
int len = ring.size();
if (y == key.size())
{
return 0;
}
string s = to_string(x)+"#"+to_string(y);
//如果m中存了x到y的最短路径,直接返回
if (m[s])
{
return m[s];
}
//否则:进行查找
//顺时针
int x1 = x;
int count1 = 1;
while (ring[x1] != key[y])
{
x1++;
count1++;
if (x1 == len)
{
x1 = 0;
}
}
int sum1 = dfs(ring, x1, key, y+1) + count1;
//逆时针
int count2 = 1;
int x2 = x;
while (ring[x2] != key[y])
{
x2--;
count2++;
if (x2 == -1)
{
x2 = len - 1;
}
}
int sum2 = dfs(ring, x2, key, y+1) + count2;
m[s] = min(sum1, sum2);
return min(sum1, sum2);
}
int findRotateSteps(string ring, string key)
{
return dfs(ring, 0, key, 0);
}