vector<int> twoSum(vector<int>& nums, int target) {

unordered_map<int,int> record;

for(int i = 0 ; i < nums.size() ; i ++)

record[nums[i]] = i;

for(int i = 0 ; i < nums.size() ; i ++){

unordered_map<int,int>::iterator iter = record.find(target - nums[i]);

if(iter != record.end() && iter->second != i){

int res[] = {i, iter->second};

return vector<int>(res, res + 2);

}

}

throw invalid_argument("the input has no solution");

}

for(int e: vec)

cout << e << " ";

cout << endl;

const int nums[] = {0,4,3,0};

vector<int> nums_vec( nums, nums + sizeof(nums)/sizeof(int) );

int target = 0;

printVec(Solution().twoSum(nums_vec, target));

return 0;

}