# 167. Two Sum II - Input array is sorted [medium] (Python)

## 题目链接

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/

## 题目原文

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

## 思路方法

### 思路一

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

### 思路二

class Solution(object):
def twoSum(self, numbers, target):
"""
:type numbers: List[int]
:type target: int
:rtype: List[int]
"""
num_dict = {}
for i, num in enumerate(numbers):
if (target - num) in num_dict:
return [num_dict[target - num], i + 1]
num_dict[num] = i + 1

PS: 写错了或者写的不清楚请帮忙指出，谢谢！

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客