擅长:python、mysql、java
<p>以下是一个不使用zip和lambda的解决方案:</p>
<pre><code>unsortedList = [10, 12, 23, 0, 8]
baseList = [30, 7, 13, 7, 1]
#prep step: modifies the baseList based on how often a duplicate number appears
visited = []
for i, number in enumerate(baseList):
visited.append(number)
baseList[i] += visited.count(number)/len(baseList)
#main code
result = []
for item in baseList:
idx = sorted(baseList).index(item)
result.append(sorted(unsortedList)[idx])
print(result)
#prints [23, 8, 12, 10, 0]
</code></pre>