擅长:python、mysql、java
<p>你让这里的生活变得很艰难;如果您希望定期访问元素的索引,那么应该使用类似<code>for index, hash in enumerate(UniqueTierHash)</code>的内容迭代列表,但在这种情况下,我认为您并不真正需要索引;您只需要访问两个相邻的元素,这样就可以获取第一个元素,然后遍历剩余的列表,每次都保留“previous”值。另一种方法是迭代索引,每次通过循环直接获取元素</p>
<p>我只保留了通过您测试的实际值;你似乎保留了所有的价值观,有些价值观保留了两次</p>
<pre class="lang-py prettyprint-override"><code>UniqueTierHash = [ '6:3:5:6.5:5:2.5',
'6:3:5:5.5:5:3.5',
'6:2.5:5:5:4:3',
'6:2.5:5.5:5.5:4.5:3.5',
'5.5:4.5:4.5:4.5:5.5:4.5' ]
TierHashKeep = []
this_hash = UniqueTierHash[0] # first element to start the pairing
for next_hash in UniqueTierHash[1:]: # iterate through rest of list
test = function.CompareTierHash(this_hash, next_hash)
print(this_hash + ' \n' + next_hash) ####### check #
print(test) ####### check #
if test == True:
TierHashKeep.append(this_hash)
elif test != False:
print('Error in TierCompare')
this_hash = next_hash # roll forward to the next pair
print(TierHashKeep) ####### check #
</code></pre>