leecode题号167：

aa

解法一：

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        n = len(numbers)
        print(numbers)
        for i in range(n):
            for j in range(i, n):
                print("i:%d,j:%d,numbers[i]:%d,numbers[j]:%d,target:%d" %(i,j,numbers[i], numbers[j],target))
                if numbers[i] + numbers[j] == target and i != j:
                    print("[i+1, j+1],%d,%d" %(i, j))
                    return [i+1, j+1]

好像有问题，提交没有通过

解法二：

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        i = 0
        j = len(numbers) - 1
        while i < j:
            res = numbers[i] + numbers[j]
            if res > target:
                j = j-1
            elif res < target:
                i = i+1
            else:
                return [i + 1 ,j + 1]
                
            

解法三：