Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.

Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

The return format should be zero-based indices.

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> vecRes;
        unordered_map<int, int> mDelta;
        int i = 0;
        for(i = 0; i < nums.size(); i++){
            mDelta[target-nums[i]] = i;
        }
        for(i = 0; i< nums.size(); i++){
            unordered_map<int, int>::iterator it = mDelta.find(nums[i]);
            if(it != mDelta.end() && it->second != i){
                vecRes.push_back(i);
                vecRes.push_back(it->second);
                break;
            }
        }
        return vecRes;
    }
};