leetcode 46: Two Sum
2013-01-19 19:33
471 查看
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
python:
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 { public: vector<int> twoSum(vector<int> &numbers, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> rel; map<int, int> myMap; //key for number expected, value stores the index of original value. for( int i=0; i<numbers.size(); i++) { if( myMap.find( numbers[i] ) != myMap.end() ) { rel.push_back( myMap[ numbers[i] ]); rel.push_back( i+1); } else{ myMap[ target - numbers[i] ] = i+1; } } return rel; } };
python:
class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ dic = {} for i,val in enumerate(nums): if target-val in dic: return [dic[target-val]+1,i+1] else: dic[val] = i return [-1,-1]
相关文章推荐
- leetcode 46: Two Sum
- two sum - leetcode
- LeetCode 1. Two Sum
- (LeetCode)Two Sum
- LeetCode 1. Two Sum
- LeetCode #1: Two Sum
- [leetcode]1. Two Sum
- leetcode(1) Two sum
- LeetCode-Two Sum
- [leetcode]Two Sum
- 【LeetCode】Two Sum
- 【Leetcode】two sum
- 【leetcode with java】1 Two Sum
- LeetCode-Two Sum
- 算法分析与设计丨第一周丨 LeetCode(1)——Two Sum
- LeetCode-Two Sum
- LeetCode 1 Two Sum
- [leetcode 1] Two Sum
- leetcode 1: Two Sum
- Two Sum (leetcode)