Python学习——leetcode(Two Sum)

Two Sum-------Python  accepted

class Solution:
    # @return a tuple, (index1, index2)
    def twoSum(self, num, target):
		if num:
			numbers=sorted(num)
			index1,index2=0,len(num)-1
			while index1<index2:
				if numbers[index1]+numbers[index2]==target:
					if numbers[index1]==numbers[index2]:
						in1=num.index(numbers[index1])+1
						num.remove(numbers[index1])
						in2=num.index(numbers[index2])+2
						num.insert(in1-1,numbers[index1])
					else:
						in1=num.index(numbers[index1])+1
						in2=num.index(numbers[index2])+1
					if in1>in2:
						return in2,in1
					else:
						return in1,in2
					#return num.index(numbers[index1])+1,num.index(numbers[index2])+1
					break
				elif numbers[index1]+numbers[index2]>target:
					index2-=1
				else:
					index1+=1