擅长:python、mysql、java
<p><a href="https://docs.python.org/3.3/library/functions.html#zip" rel="nofollow noreferrer">zip</a>两倍字符串化整数,逐位比较,求绝对差。<br/>
我不清楚9->;1是两步(9->;0->;1)还是8步。我假设是后者:</p>
<pre><code>def minimumMoves(a, m):
a = [str(x) for x in a]
m = [str(x) for x in m]
return sum([
abs(int(f) - int(s))
for x, y in zip(a, m)
for f, s in zip(x, y)
])
a = [4321, 3211]
m = [5432, 4302]
minimumMoves(a, m)
>>> 8
</code></pre>