Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
Subscribe to see which companies asked this question
是个新思路，用了O（n）的时间复杂度。
1 class Solution { 2 public: 3 vector<int> twoSum(vector<int>& nums, int target) { 4 int i,j; 5 vector<int> result; 6 map<int,int> get; 7 for(i=0;i<nums.size();i++){ 8 if(get.count(target-nums[i])>0){ 9 result.push_back(get[target-nums[i]]); 10 result.push_back(i+1); 11 return result; 12 } 13 if(get.count(nums[i])==0){ 14 get[nums[i]]=i+1; 15 } 16 } 17 } 18 };
原文：http://www.cnblogs.com/Deribs4/p/4948132.html