首页 > 代码库 > Leetcode Two Sum
Leetcode Two Sum
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 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
解题思路：此题的关键是对给定数组进行排序,把排好序的数组首尾开始查找，两个数的和大于给定值则right--，否则则left++
1 class Solution: 2 # @return a tuple, (index1, index2) 3 def twoSum(self, num, target): 4 5 #sort the array, and remeber the index 6 #can do from the start and the end to the middle 7 numbers=sorted(num) 8 9 length=len(numbers)10 11 index=[]12 13 left=014 right=length-115 16 while(left<right):17 sum_data=http://www.mamicode.com/numbers[left]+numbers[right]18 if(sum_data>target):19 right=right-120 elif(sum_data<target):21 left=left+122 else:23 for i in xrange(length):24 if(num[i]==numbers[left]):25 index.append(i+1)26 elif(num[i]==numbers[right]):27 index.append(i+1)28 29 if (len(index)==2):30 break31 break32 result=tuple(index)33 return result
Leetcode Two Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。