首页 > 代码库 > [LintCode] Two Sum 两数之和
[LintCode] 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.
Notice
You may assume that each input would have exactly one solution
Have you met this question in a real interview?
Yes
Example
numbers=[2, 7, 11, 15], target=9
return [1, 2]
Challenge
Either of the following solutions are acceptable:
- O(n) Space, O(nlogn) Time
- O(n) Space, O(n) Time
LeetCode上的原题，请参见我之前的博客Two Sum。
class Solution {public: /* * @param numbers : An array of Integer * @param target : target = numbers[index1] + numbers[index2] * @return : [index1+1, index2+1] (index1 < index2) */ vector<int> twoSum(vector<int> &nums, int target) { unordered_map<int, int> m; for (int i = 0; i < nums.size(); ++i) m[nums[i]] = i; for (int i = 0; i < nums.size(); ++i) { int t = target - nums[i]; if (m.count(t) && m[t] != i) { return {i + 1, m[t] + 1}; } } return {}; }};
[LintCode] Two Sum 两数之和
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。