leetcode--1. Two Sum

题目：https://leetcode.com/problems/two-sum/#/description

class Solution {public:    vector<int> twoSum(vector<int>& nums, int target) {        map<int,int> s;        vector<int> res;        for(int i=0;i<nums.size();i++){            s[nums[i]]=i;        }        for(int i=0;i<nums.size();i++){            if(s.find(target-nums[i])!=s.end()&&s[target-nums[i]]!=i){                res.push_back(i);                res.push_back(s[target-nums[i]]);                break;            }        }        return res;    }};