LeetCode 1. Two Sum (c++ stl map)

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

stl map代码：

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