[Leetcode]1. Two Sum

快速的查找所以使用hash表的思想，利用map结构实现~

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int,int> table;
        vector<int> solution;
        int res;
        size_t i=0;
        bool flag =false;
        for(i;i<nums.size();i++){
            res=target-nums[i];
            if(table.find(res)!=table.end()){
                flag=true;
                break;
            
            }
            if(table.find(nums[i])==table.end()){
                table.insert(pair<int,int>(nums[i],i));
            }
        }
       if(flag){
           solution.push_back(table[res]);
           solution.push_back(i);
       }
       return solution;
        
    }
};