题解 | #两数之和#
两数之和
https://www.nowcoder.com/practice/20ef0972485e41019e39543e8e895b7f
#include <iostream> #include <unordered_map> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param numbers int整型vector * @param target int整型 * @return int整型vector */ vector<int> twoSum(vector<int>& numbers, int target) { unordered_map<int,int> Nums; for(int i = 0;i < numbers.size(); i++) Nums.emplace(numbers[i],i); for(int i =0; i < numbers.size(); i++){ if( Nums.count( target - numbers[i] ) && Nums[target - numbers[i]] != i){ return { Nums[target - numbers[i]] < i ? Nums[target - numbers[i]] +1 : i+1, Nums[target - numbers[i]] > i ? Nums[target - numbers[i]] +1 : i+1 }; } } return {}; } };