-
Problem Description:
-
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.Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
C++ Solution:
这个问题用TSL中的‘map’做较容易得到解决。
-
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { map<int,int> MAP; vector<int> Result; //将数据放到‘map’中并进行编码: for (int i = 0; i < nums.size(); i++) { MAP[nums[i]] = i; } //尝试以暴力搜索的方式,在‘map’中查找和‘Temp’匹配的结果 for (int i = 0; i < nums.size(); i++) { int Temp = target - nums[i]; //下面的‘if()’块里,需要考虑如‘6’这种,可以被同一个‘3’组成两次的情况: if ( MAP.find(Temp)!=MAP.end() && i!=MAP[Temp] ) { Result.push_back(i); Result.push_back(MAP[Temp]); break; } } return Result; } };
备注:答案多有借鉴,请多担待