- C
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target) {
int *result = (int *)malloc(2*sizeof(int));
// 嵌套遍历
for(int i=0;i<numsSize-1;i++){
for(int j=i+1;j<numsSize;j++){
if(nums[i]+nums[j]==target){
result[0] = i;
result[1] = j;
return result;
}
}
}
return result;
}
- C++
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
// 构建哈希表
map<int, int>m;
for(int i=0;i<nums.size();i++){
m[nums[i]] = i;
}
// 保存结果
int result[2];
// 在哈希表中查找键值对
for(int i=0;i<nums.size();i++){
if(m.count(target-nums[i])>0){
if(i != m[target-nums[i]])
{
result[0] = i;
result[1] = m[target-nums[i]];
break;
}
}
}
return vector<int>(result, result+2);
}
};
- Python
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
m = dict()
for i in range(len(nums)):
m[nums[i]] = i
for i in range(len(nums)):
if target - nums[i] in m:
if not i == m[target-nums[i]]:
return [i, m[target-nums[i]]]