[leetcode]1. Two Sum

class Solution {public:    vector<int> twoSum(vector<int>& nums, int target)     {        map<int,int>m;        map<int,int>::iterator iter;        vector<int> ret;        for(int i=0;i<nums.size();i++)        {            iter=m.find(target-nums[i]);            if (iter!=m.end())                {                    ret.push_back(iter->second);                    ret.push_back(i);                    return ret;                }            m.insert(pair<int,int>(nums[i],i));        }        return ret;    }};