Leetcode: Two Sum
2013-09-28 01:03
246 查看
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
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
vector<int> twoSum(vector<int> &numbers, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> res; int length = numbers.size(); if(length < 2)return res; map<int,int> mp; for(int i = 0; i < length; ++i) mp[numbers[i]] = i; map<int,int>::iterator it = mp.end(); for(int i = 0; i < length; ++i) { it = mp.find(target - numbers[i]); if(it != mp.end()) { res.push_back(min(i+1,it->second +1)); res.push_back(max(i+1,it->second +1)); break; } } return res; }
相关文章推荐
- leetcode做题体会 two sum
- [LeetCode] Two Sum
- LeetCode --- Two Sum
- LeetCode-Two Sum
- LeetCode 1. Two Sum
- LeetCode-001 Two Sum
- leetcode 1 Two Sum
- [LeetCode] Two Sum
- [LeetCode]Two Sum
- LeetCode | Two sum
- [leetcode刷题系列]Two Sum
- [LeetCode]Two Sum
- LeetCode:Two Sum
- [LeetCode]Two Sum
- LeetCode1:Two Sum
- LeetCode题目解析(一):1、two sum
- LeetCode1 Two Sum
- LeetCode之Two Sum
- [LeetCode] Two Sum
- leetcode1~Two Sum