如题,但是不能改变数组元素的顺序,就像是
for (int i=0; i<n-1; i++)
for (int j=i+1;j<n;j++)
if (arr[i] == arr[j])
这种形式的判断方法。我找了下资料发现python也最多就是for a in b这种形式的遍历
手头没有环境,没有测试,但是思路是这样
def test(self):
abc = ('aa','bb','cc','aa','dd','ee')
rows = range(0,len(abc))
result = ''
for i in rows:
first = abc[i]
for m in rows:
if first == abc[m]:
result = first + ' more than two'
print result
continue
arr=(2,5,8,10,8,12)
n=len(arr)
for i in range(0,n):
for j in range(i+1,n):
if(arr[i]==arr[j]):
print "%d,%d" %(arr[i], arr[j])
借助集合,判断长度是否相等
temp = set(arr)
if len(temp) == len(arr):
print True
else:
print False