[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, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
解题思路
这道题意思很好理解,就是找到vector里加起来等于target的两个数的编号,最大问题是寻找方法,用循环会使这道题目超时,那么我就觉得可以用map容器解决这道问题,把值和序号对应起来后,找到两个加起来等于target的值,压入结果的vector,最后返回这个vector就能解决这个问题了。
实验代码
/**
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> m;
vector<int> v;
for (int i = 0; i < nums.size(); i++) {
int t = target - nums[i];
if (m.find(t) != m.end()) {
v.push_back(m[t]);
v.push_back(i);
return v;
}
m[nums[i]] = i;
}
return v;
}
};