题目链接: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].
<1>题目思路:这个题目比较简单,直接用穷举的方法,用两个变量顺序循环数组进行匹配,时间复杂度为 O(n2) 。
<2>代码:
int* twoSum(int* nums, int numsSize, int target) {
int *indices = (int *)malloc(2 * sizeof(int));
for (int i = 0; i < numsSize; i++) {
for (int j = i + 1; j < numsSize; j++) {
if (nums[i] + nums[j] == target) {
indices[0] = i;
indices[1] = j;
return indices;
}
}
}
return indices;
}
<3>提交结果:
可以看到,虽然通过了测试,但是运行时间并不是非常理想,在讨论中发现了运行时间更快的一种使用map的方法:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> map;
int n = (int)nums.size();
for (int i = 0; i < n; i++) {
auto p = map.find(target-nums[i]);
if (p!=map.end()) {
return {p->second+1, i+1};
}
map[nums[i]]=i;
}
}
};