[leetcode]1. Two Sum

题目链接:https://leetcode.com/problems/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.

Example:

Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

class Solution { public: vector<int> twoSum(vector<int>& nums,int target) { map<int,int> searched; vector<int> result; for(int i=0;i<nums.size();i++) { map<int,int>::iterator it=searched.find(target-nums[i]); if(it==searched.end()) { searched[nums[i]]=i; } else { result.insert(result.end(),i); result.insert(result.end(),searched[target-nums[i]]); return result; } } return result; } };