https://leetcode.com/problems/two-sum/
class Solution { //经典hash处理 public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; map<int, int>Mp; for(int i=0; i<nums.size();i++){ Mp[nums[i]] = i; } for(int j=0; j<nums.size(); j++){ //仅仅只有一对 int num = target-nums[j]; if(Mp.count(num)&&Mp[num]!=j){ res.push_back(j); res.push_back(Mp[num]); } } return res; } };
