LeetCode算法分析1.Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
The return format had been changed to zero-based indices. Please read the above updated description carefully.
给定一个数组,和一个目标值。返回数组中相加等于目标值的两个数的位置。返回的格式也是数组形式,以0开始。
解题思路
1、首先,选择合适的数据结构;这里建议选择map
2、查找target-nums[i]是否在map中:
a、存在:返回的数值中,第一个值是找到的map中保存的value,第二个值是当前的i;
b、不存在:如果当前的nums[i]也不在map中,则将当前值加入map中。
3、由于输入的数值和target一定会有一个答案,所以不用考虑边界条件,只是需要考虑时间复杂度。不要用蛮力解决。
Accept代码
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> tempMap;
map<int, int>::iterator ite;
vector<int> result;
for (int i = 0; i!=nums.size(); i++)
{
ite = tempMap.find(target - nums[i]);
if (ite!=tempMap.end())
{
result.push_back(ite->second);
result.push_back(i);
}
else {
ite = tempMap.find(nums[i]);
if (ite==tempMap.end())
{
tempMap[nums[i]] = i;
}
}
}
return result;
}
};