【 LeetCode】 |Two Sum

Question:

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

• Because nums[0] + nums[1] = 2 + 7 = 9,
• return [0, 1].

Slove：

• 方法一： 暴力穷解法

两个for循环嵌套，时间复杂度为 O(n^2)；

• 方法二：

# 保存用户输入的array， 并确保每个元素为int类型；
array = map(int, raw_input().split())
target = input()

# 依次遍历array元素， 并判断target-i是否在array列表中， 间接实现要求;
for i in array:
    if target-i in array:
        index1 = array.index(i)
        index2 = array.index(target-i)

print  "index1=%d, index2=%d" %(index1, index2)

LeetCode改编版

Question:

Given an array of integers, 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 index2. Please note that your returned answer (both index1 and index2)are not zero-based. You may assume that echo input would have exactly one solution .

Example:

• Input:

  numbers={2,7,11,15}
  target = 9

• Output:

  index1=1, index2=2

• Test

  • test1: array,target = [3,2,4], 6
  • test2: array,target = [0,1,4,0], 0

Slove：

array = map(int, raw_input().split())
target = input()

for i in array:
    if target-i in array:
        index1 = array.index(i)+1
        index2 = array.index(target-i)+2

# 确保index1<index2;
index1, index2 = sorted([index1, index2])
print  "index1=%d, index2=%d" %(index1, index2)