【leetcode】Two Sum
2015-04-02 11:36
323 查看
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
class Solution { public: vector<int> twoSum(vector<int> &numbers, int target) { map<int, int> m; vector<int> result; for(int i=0; i<numbers.size(); i++){ if (m.find(numbers[i])==m.end() ) { m[target - numbers[i]] = i; }else { result.push_back(m[numbers[i]]+1); result.push_back(i+1); break; } } return result; } };
相关文章推荐
- [leetcode] 1. Two Sum
- LeetCode : Two Sum
- LeetCode奇幻漂流(一)Two Sum
- Leetcode - Array - 1. Two Sum (水题,O[n]和O[n^2]实现)
- [Leetcode] 1 - Two Sum
- [LeetCode] Two Sum, Solution
- Leetcode学习(1)—— Two Sum
- LeetCode:Algorith1 —Two Sum
- LeetCode——Two Sum
- LeetCode --> Two Sum
- Leetcode 1:two sum
- LeetCode No2--Two Sum
- LeetCode题解 #1 Two Sum
- [LeetCode] Two Sum
- Leetcode 1.Two Sum
- Leetcode第一题--------- Two Sum
- LeetCode 1. Two Sum
- [LeetCode]Two Sum
- LeetCode 1. Two Sum
- LeetCode - 1. Two Sum