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].
2.C++ 解法
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> temp;
for(auto i=0;i<nums.size();i++){
if(temp.find(target-nums[i])!=temp.end())
return vector<int> {temp[target-nums[i]],i};
temp[nums[i]]=i;
}
return vector<int>();
}
};
3.Go解法
func twoSum(nums []int, target int) []int {
var temp=make(map[int]int)
for i:=0;i<len(nums);i++ {
index,ok := temp[target-nums[i]]
if (ok){
return []int{index,i}
}else{
temp[nums[i]]=i
}
}
return []int{}
}