1 class Solution(object):
 2     def twoSum(self, numbers, target):
 3         """
 4         :type numbers: List[int]
 5         :type target: int
 6         :rtype: List[int]
 7         """
 8         if len(numbers) == 0:
 9             return []
10         i = 0
11         j = 1
12         while j < len(numbers) and numbers[j] <= target:#先找出最接近target的值，也就是上限
13             j += 1
14         if j >= len(numbers):
15             j -= 1
16         while True:
17             if numbers[i] + numbers[j] == target:
18                 return [i+1,j+1]
19             elif numbers[i] + numbers[j] < target:
20                 i += 1
21             else:
22                 j -= 1
23                 i = 0

 1 class Solution(object):
 2     def twoSum(self, numbers, target):
 3         """
 4         :type numbers: List[int]
 5         :type target: int
 6         :rtype: List[int]
 7         """
 8         left = 0
 9         right = len(numbers)-1
10         while left<right:
11             sum = numbers[left]+numbers[right]
12             if sum==target:
13                 return [left+1, right+1]
14             elif sum>target:
15                 right -= 1
16             else:
17                 left += 1

 1 class Solution(object):
 2     def twoSum(self, numbers, target):
 3         """
 4         :type numbers: List[int]
 5         :type target: int
 6         :rtype: List[int]
 7
 8         """
 9         Dnum = {}
10         for i in range(len(numbers)):
11             if numbers[i] not in Dnum:
12                 Dnum[target-numbers[i]] = i
13             else:
14                 return [Dnum[numbers[i]]+1, i+1]