关闭

LeetCode-Two Sum-解题报告

标签: C++leetcode
203人阅读 评论(0) 收藏 举报
分类:

原题链接 https://leetcode.com/problems/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 


在数组中找到2个数的和等于目标数。


使用一张hash表讲每个数出现的位置记录下来。


然后开始遍历数组。对于nums[i], 如果target-nums[i] 如果在hash表中存在 就可以结束遍历返回答案了。


class Solution {
public:
	vector<int> twoSum(vector<int>& nums, int target) {
		map<int, vector<int> >Hash;
		vector<int>ans;
		int i = 1;
		for (auto &item : nums)
		{
			Hash[item].push_back(i++);
		}
		i = 1;
		for (auto &item : nums)
		{
			vector<int>& tmp = Hash[target - item];
			if (!tmp.empty())
			{
				for (auto &index : tmp)
				{
					if (index != i)
					{
						ans.push_back(i);
						ans.push_back(index);
						return ans;
					}
				}
			}
			i++;
		}
		return ans;
	}
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:14327次
    • 积分:841
    • 等级:
    • 排名:千里之外
    • 原创:72篇
    • 转载:6篇
    • 译文:0篇
    • 评论:0条
    文章分类