leetcode记录-Two Sum

哈希表，注意返回的是原索引

class Solution {public:    vector<int> twoSum(vector<int> &numbers, int target) {        unordered_map<int, int> hashmap;        vector<int> twonum;        for(int i=0; i<numbers.size(); i++)        {            if(hashmap[target-numbers[i]]>0)            {                twonum.push_back(hashmap[target-numbers[i]]);                twonum.push_back(i+1);                break;            }            else            {                hashmap[numbers[i]] = i+1;            }        }        if(twonum[0]>twonum[1])        {            swap(twonum[0],twonum[1]);        }           return twonum;    }};